![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 22 matches
- 1993
- Warren P. Adams, Hanif D. Sherali:
Mixed-integer bilinear programming problems. Math. Program. 59: 279-305 (1993) - James C. Bean, Robert L. Smith:
Conditions for the discovery of solution horizons. Math. Program. 59: 215-229 (1993) - Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson:
A note on the prize collecting traveling salesman problem. Math. Program. 59: 413-420 (1993) - Sunil Chopra
, M. R. Rao:
The partition problem. Math. Program. 59: 87-115 (1993) - Chuangyin Dang
:
The D2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations. Math. Program. 59: 307-324 (1993) - Stephan Dempe
:
Directional differentiability of optimal solutions under Slater's condition. Math. Program. 59: 49-69 (1993) - Peter Gritzmann, Victor Klee:
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program. 59: 163-213 (1993) - Alfredo N. Iusem:
On the convergence of iterative methods for symmetric linear complementarity problems. Math. Program. 59: 33-48 (1993) - Vaithilingam Jeyakumar
, Xiaoqi Yang
:
Convex composite multi-objective nonsmooth programming. Math. Program. 59: 325-343 (1993) - Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Math. Program. 59: 1-21 (1993) - Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
:
A little theorem of the big Mu in interior point algorithms. Math. Program. 59: 361-375 (1993) - Shinji Mizuno, Romesh Saigal, James B. Orlin
:
Determination of optimal vertices from feasible solutions in unimodular linear programming. Math. Program. 59: 23-31 (1993) - Kazuo Murota:
Hierarchical decomposition of symmetric discrete systems by matroid and group theories. Math. Program. 59: 377-404 (1993) - Andrzej S. Nowak
, T. E. S. Raghavan:
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game. Math. Program. 59: 249-259 (1993) - Eliane R. Panier, André L. Tits:
On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Math. Program. 59: 261-276 (1993) - Arie Tamir:
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math. Program. 59: 117-132 (1993) - Michael J. Todd:
Combining phase I and phase II in a potential reduction algorithm for linear programming. Math. Program. 59: 133-150 (1993) - Kaoru Tone:
An active-set strategy in an interior point method for linear programming. Math. Program. 59: 345-360 (1993) - Paul Tseng:
Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. 59: 231-247 (1993) - Livinus Ugochukwu Uko:
Remarks on the generalized Newton method. Math. Program. 59: 405-412 (1993) - José A. Ventura, Donald W. Hearn:
Restricted simplicial decomposition for convex constrained problems. Math. Program. 59: 71-85 (1993) - Yinyu Ye, Osman Güler, Richard A. Tapia, Yin Zhang:
A quadratically convergent O(qudra root(n)*L)-iteration algorithm for linear programming. Math. Program. 59: 151-162 (1993)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-08 10:49 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