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 26 matches
- 1989
- Egon Balas, Shu Ming Ng:
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. Math. Program. 45(1-3): 1-20 (1989) - Michel L. Balinski, Gabrielle Demange:
Algorithms for proportional matrices in reals and integers. Math. Program. 45(1-3): 193-210 (1989) - Francisco Barahona, Ali Ridha Mahjoub:
Facets of the balanced (acyclic) induced subgraph polytope. Math. Program. 45(1-3): 21-33 (1989) - Paolo M. Camerini, Francesco Maffioli, Carlo Vercellis:
Multi-constrained matroidal knapsack problems. Math. Program. 45(1-3): 211-231 (1989) - Giorgio Carpaneto, Matteo Fischetti, Paolo Toth:
New lower bounds for the Symmetric Travelling Salesman Problem. Math. Program. 45(1-3): 233-254 (1989) - Sunil Chopra:
On ternary problems. Math. Program. 45(1-3): 35-47 (1989) - Thomas F. Coleman, Laurie A. Hulbert:
A direct active set algorithm for large sparse quadratic programs with simple bounds. Math. Program. 45(1-3): 373-406 (1989) - Michele Conforti, Monique Laurent:
On the geometric structure of independence systems. Math. Program. 45(1-3): 255-277 (1989) - Michele Conforti, M. R. Rao:
Odd cycles and matrices with integrality properties. Math. Program. 45(1-3): 279-294 (1989) - Giorgio Gallo, Bruno Simeone:
On the supermodular knapsack problem. Math. Program. 45(1-3): 295-309 (1989) - A. B. Gamble, William R. Pulleyblank:
Forest covers and a polyhedral intersection theorem. Math. Program. 45(1-3): 49-58 (1989) - Huiling Gan, Ellis L. Johnson:
Four problems on graphs with excluded minors. Math. Program. 45(1-3): 311-330 (1989) - Jean Charles Gilbert, Claude Lemaréchal:
Some numerical experiments with variable-storage quasi-Newton algorithms. Math. Program. 45(1-3): 407-435 (1989) - Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A practical anti-cycling procedure for linearly constrained optimization. Math. Program. 45(1-3): 437-474 (1989) - Nicholas I. M. Gould, John K. Reid:
New crash procedures for large systems of linear constraints. Math. Program. 45(1-3): 475-501 (1989) - Martin Grötschel, Yoshiko Wakabayashi:
A cutting plane algorithm for a clustering problem. Math. Program. 45(1-3): 59-96 (1989) - Monique Laurent:
A generalization of antiwebs to independence systems and their canonical facets. Math. Program. 45(1-3): 97-108 (1989) - Janny M. Y. Leung, Thomas L. Magnanti, Rita Vachani:
Facets and algorithms for capacitated lot sizing. Math. Program. 45(1-3): 331-359 (1989) - Dong C. Liu, Jorge Nocedal:
On the limited memory BFGS method for large scale optimization. Math. Program. 45(1-3): 503-528 (1989) - Michel Minoux:
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. Math. Program. 45(1-3): 361-372 (1989) - Denis Naddef:
The hirsch conjecture is true for (0, 1)-polytopes. Math. Program. 45(1-3): 109-110 (1989) - Stephen G. Nash, Ariela Sofer:
Block truncated-Newton methods for parallel optimization. Math. Program. 45(1-3): 529-546 (1989) - Paolo Nobili, Antonio Sassano:
Facets and lifting procedures for the set covering polytope. Math. Program. 45(1-3): 111-137 (1989) - Manfred Padberg:
The boolean quadric polytope: Some characteristics, facets and relatives. Math. Program. 45(1-3): 139-172 (1989) - M. J. D. Powell:
A tolerant algorithm for linearly constrained optimization calculations. Math. Program. 45(1-3): 547-566 (1989) - Laurence A. Wolsey:
Strong formulations for mixed integer programming: A survey. Math. Program. 45(1-3): 173-191 (1989)
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-25 16:21 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