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 14 matches
- 2000
- Laurent Alfandari, Vangelis Th. Paschos:
Master-Slave Strategy and Polynomial Approximation. Comput. Optim. Appl. 16(3): 231-245 (2000) - Paul Armand, Jean Charles Gilbert:
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method. Comput. Optim. Appl. 16(2): 121-158 (2000) - J. Frédéric Bonnans:
Mathematical Study of Very High Voltage Power Networks III: The Optimal AC Power Flow Problem. Comput. Optim. Appl. 16(1): 83-101 (2000) - Vicente Campos, Enrique Mota:
Heuristic Procedures for the Capacitated Vehicle Routing Problem. Comput. Optim. Appl. 16(3): 265-277 (2000) - Perry Fizzano, Steven Swanson:
Scheduling Classes on a College Campus. Comput. Optim. Appl. 16(3): 279-294 (2000) - Natasa Krejic, José Mario Martínez, Margarida Mello, Elvio A. Pilotta:
Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems. Comput. Optim. Appl. 16(3): 247-263 (2000) - Günter Leugering:
Domain Decomposition of Optimal Control Problems for Dynamic Networks of Elastic Strings. Comput. Optim. Appl. 16(1): 5-27 (2000) - Guanghui Liu, Lili Jing:
Convergence of the Nonmonotone Perry and Shanno Method for Optimization. Comput. Optim. Appl. 16(2): 159-172 (2000) - Tecla De Luca, Francisco Facchinei, Christian Kanzow:
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems. Comput. Optim. Appl. 16(2): 173-205 (2000) - Helmut Maurer, Hans D. Mittelmann:
Optimization Techniques for Solving Elliptic Control Problems with Control and State Constraints: Part 1. Boundary Control. Comput. Optim. Appl. 16(1): 29-55 (2000) - João Batista Oliveira:
Evaluating Lipschitz Constants for Functions Given by Algorithms. Comput. Optim. Appl. 16(3): 215-229 (2000) - Yixun Shi:
Globally Convergent Algorithms for Unconstrained Optimization. Comput. Optim. Appl. 16(3): 295-308 (2000) - Stefan Volkwein:
Application of the Augmented Lagrangian-SQP Method to Optimal Control Problems for the Stationary Burgers Equation. Comput. Optim. Appl. 16(1): 57-81 (2000) - Changyu Wang, Naihua Xiu:
Convergence of the Gradient Projection Method for Generalized Convex Minimization. Comput. Optim. Appl. 16(2): 111-120 (2000)
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 2025-01-06 21:03 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