Остановите войну!
for scientists:
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 23 matches
- 1996
- John E. Mitchell, Brian Borchers:
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method. Ann. Oper. Res. 62(1): 253-276 (1996) - Kurt M. Anstreicher:
Large step volumetric potential reduction algorithms for linear programming. Ann. Oper. Res. 62(1): 521-538 (1996) - Kurt M. Anstreicher, Robert M. Freund:
Preface. Ann. Oper. Res. 62(1) (1996) - Paul T. Boggs, Paul D. Domich, Janet E. Rogers:
An interior point method for general large-scale quadratic programming problems. Ann. Oper. Res. 62(1): 419-437 (1996) - Marc G. Breitfeld, David F. Shanno:
Computational experience with penalty-barrier methods for nonlinear programming. Ann. Oper. Res. 62(1): 439-463 (1996) - Robert M. Freund:
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution. Ann. Oper. Res. 62(1): 29-57 (1996) - Tsung-Min Hwang, Chih-Hung Lin, Wen-Wei Lin, Shu-Cherng Fang:
A relaxed primal-dual path-following algorithm for linear programming. Ann. Oper. Res. 62(1): 173-196 (1996) - Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Primal-dual target-following algorithms for linear programming. Ann. Oper. Res. 62(1): 197-231 (1996) - Masakazu Kojima:
Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs. Ann. Oper. Res. 62(1): 1-28 (1996) - Aaron Melman, R. Polyak:
The Newton modified barrier method for QP problems. Ann. Oper. Res. 62(1): 465-519 (1996) - Shinji Mizuno, Florian Jarre:
An infeasible-interior-point algorithm using projections onto a convex set. Ann. Oper. Res. 62(1): 59-80 (1996) - Masakazu Muramatsu, Takashi Tsuchiya:
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption. Ann. Oper. Res. 62(1): 325-355 (1996) - Florian A. Potra:
AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. Ann. Oper. Res. 62(1): 81-102 (1996) - Romesh Saigal:
A simple proof of a primal affine scaling method. Ann. Oper. Res. 62(1): 303-324 (1996) - Romesh Saigal:
The primal power affine scaling method. Ann. Oper. Res. 62(1): 375-417 (1996) - Ulrich Schättler:
An interior-point method for semi-infinite programming problems. Ann. Oper. Res. 62(1): 277-301 (1996) - Jos F. Sturm, Shuzhong Zhang:
New complexity results for the Iri-Imai method. Ann. Oper. Res. 62(1): 539-564 (1996) - Jie Sun:
A convergence analysis for a convex version of Dikin's algorithm. Ann. Oper. Res. 62(1): 357-374 (1996) - Michael J. Todd, Yinyu Ye:
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms. Ann. Oper. Res. 62(1): 233-252 (1996) - Stephen A. Vavasis, Yinyu Ye:
Identifying an optimal basis in linear programming. Ann. Oper. Res. 62(1): 565-572 (1996) - Stephen J. Wright:
A path-following interior-point algorithm for linear and quadratic problems. Ann. Oper. Res. 62(1): 103-130 (1996) - Xiaojie Xu, Pi-Fang Hung, Yinyu Ye:
A simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62(1): 151-171 (1996) - Detong Zhang, Yin Zhang:
A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence. Ann. Oper. Res. 62(1): 131-150 (1996)
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-07-21 03:32 CEST 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