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 17 matches
- 2000
- Norbert Ascheuer, Michael Jünger, Gerhard Reinelt:
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. 17(1): 61-84 (2000) - Alfred Auslender, Rafael Correa:
Primal and Dual Stability Results for Variational Inequalities. Comput. Optim. Appl. 17(2-3): 117-130 (2000) - Bintong Chen, Xiaojun Chen:
A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints. Comput. Optim. Appl. 17(2-3): 131-158 (2000) - Andreas Fischer, Houyuan Jiang:
Merit Functions for Complementarity and Related Problems: A Survey. Comput. Optim. Appl. 17(2-3): 159-182 (2000) - Masao Fukushima, Liqun Qi:
Introduction. Comput. Optim. Appl. 17(2-3): 115 (2000) - Keisuke Hotta, Masatora Inaba, Akiko Yoshise:
A Complexity Analysis of a Smoothing Method Using CHKS-functions for Monotone Linear Complementarity Problems. Comput. Optim. Appl. 17(2-3): 183-201 (2000) - Charles R. Johnson, Joel Pitkin, David P. Stanford:
Line-Sum Symmetry via the DomEig Algorithm. Comput. Optim. Appl. 17(1): 5-10 (2000) - Belinda B. King, Ekkehard W. Sachs:
Semidefinite Programming Techniques for Reduced Order Systems with Guaranteed Stability Margins. Comput. Optim. Appl. 17(1): 37-59 (2000) - Vladimir Kirilyuk, James E. Falk:
Minimizing the Mean Damage for Parallel-Series Systems with Two Failure Modes. Comput. Optim. Appl. 17(2-3): 301-328 (2000) - Dong-Hui Li, Masao Fukushima:
Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems. Comput. Optim. Appl. 17(2-3): 203-230 (2000) - Chin-Sung Liu, Ching-Huan Tseng:
Parallel Synchronous and Asynchronous Space-Decomposition Algorithms for Large-Scale Minimization Problems. Comput. Optim. Appl. 17(1): 85-107 (2000) - Houduo Qi, Li-Zhi Liao:
A Smoothing Newton Method for General Nonlinear Complementarity Problems. Comput. Optim. Appl. 17(2-3): 231-253 (2000) - J. Ben Rosen, Haesun Park, John Glick, Lei Zhang:
Accurate Solution to Overdetermined Linear Equations with Errors Using L1 Norm Minimization. Comput. Optim. Appl. 17(2-3): 329-341 (2000) - Michael V. Solodov, Paul Tseng:
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. Comput. Optim. Appl. 17(2-3): 255-277 (2000) - Mohamed A. Tawhid, M. Seetharama Gowda:
On Two Applications of H-Differentiability to Optimization and Complementarity Problems. Comput. Optim. Appl. 17(2-3): 279-299 (2000) - Michael W. Trosset:
Distance Matrix Completion by Numerical Optimization. Comput. Optim. Appl. 17(1): 11-22 (2000) - Luís Nunes Vicente:
Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming. Comput. Optim. Appl. 17(1): 23-35 (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-03 21:51 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