default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2010
- Bernardetta Addis, Werner Schachinger:
Morse potential energy minimization: Improved bounds for optimal configurations. Comput. Optim. Appl. 47(1): 129-131 (2010) - Bernardo Almada-Lobo, Diego Klabjan, Maria Antónia Carravilla, José Fernando Oliveira:
Multiple machine continuous setup lotsizing with sequence-dependent setups. Comput. Optim. Appl. 47(3): 529-552 (2010) - Thiago A. de André, Paulo J. S. Silva:
Exact penalties for variational inequalities with applications to nonlinear complementarity problems. Comput. Optim. Appl. 47(3): 401-429 (2010) - Mihai Anitescu, Alessandro Tasora:
An iterative approach for cone complementarity problems for nonsmooth dynamics. Comput. Optim. Appl. 47(2): 207-235 (2010) - Marco Baglietto, Cristiano Cervellera, Marcello Sanguineti, Riccardo Zoppoli:
Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling. Comput. Optim. Appl. 47(2): 349-376 (2010) - Andrzej Cegielski, Robert Dylewski:
Variable target value relaxed alternating projection method. Comput. Optim. Appl. 47(3): 455-476 (2010) - Yixin Chen, Minmin Chen:
Extended duality for nonlinear programming. Comput. Optim. Appl. 47(1): 33-59 (2010) - Jein-Shan Chen, Shaohua Pan:
An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming. Comput. Optim. Appl. 47(3): 477-499 (2010) - E. Michael Gertz, Joshua D. Griffin:
Using an iterative linear solver in an interior-point method for generating support vector machines. Comput. Optim. Appl. 47(3): 431-453 (2010) - Djamal Habet, Michel Vasquez, Yannick Vimont:
Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite. Comput. Optim. Appl. 47(2): 307-333 (2010) - Omid Bozorg Haddad, Mahsa Mirmomeni, Mahboubeh Zarezadeh Mehrizi, Miguel A. Mariño:
Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources. Comput. Optim. Appl. 47(1): 97-128 (2010) - Erwin Hernández, Dante Kalise, Enrique Otárola:
Numerical approximation of the LQR problem in a strongly damped wave equation. Comput. Optim. Appl. 47(1): 161-178 (2010) - Jurij Mihelic, Borut Robic:
Flexible-attribute problems. Comput. Optim. Appl. 47(3): 553-566 (2010) - Walter Murray, Kien Ming Ng:
An algorithm for nonlinear optimization problems with binary variables. Comput. Optim. Appl. 47(2): 257-288 (2010) - Panos M. Pardalos, Oleg V. Shylo, Alkis Vazacopoulos:
Solving job shop scheduling problems utilizing the properties of backbone and "big valley". Comput. Optim. Appl. 47(1): 61-76 (2010) - Ning Ruan, David Yang Gao, Y. Jiao:
Canonical dual least square method for solving general nonlinear systems of quadratic equations. Comput. Optim. Appl. 47(2): 335-347 (2010) - Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez:
A new strategy for the undirected two-commodity maximum flow problem. Comput. Optim. Appl. 47(2): 289-305 (2010) - Irene Sygkouna, Marios-Polychronis Drakos, Miltiades E. Anagnostou:
Route planning for agent-based information retrieval. Comput. Optim. Appl. 47(1): 77-96 (2010) - Akiko Takeda, Shunsuke Taguchi, Tsutomu Tanaka:
A relaxation algorithm with a probabilistic guarantee for robust deviation optimization. Comput. Optim. Appl. 47(1): 1-31 (2010) - Paul Tseng, Sangwoon Yun:
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47(2): 179-206 (2010) - Winnifried Wollner:
A posteriori error estimates for a finite element discretization of interior point methods for an elliptic optimization problem with state constraints. Comput. Optim. Appl. 47(1): 133-159 (2010) - Hui-juan Xiong, Bo Yu:
An aggregate deformation homotopy method for min-max-min problems with max-min constraints. Comput. Optim. Appl. 47(3): 501-527 (2010) - Gonglin Yuan, Zengxin Wei:
Convergence analysis of a modified BFGS method on convex minimizations. Comput. Optim. Appl. 47(2): 237-255 (2010) - Mingqiang Zhu, Stephen J. Wright, Tony F. Chan:
Duality-based algorithms for total-variation-regularized image restoration. Comput. Optim. Appl. 47(3): 377-400 (2010)
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-29 11:02 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint