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 24 matches
- 2010
- Kent Andersen, Quentin Louveaux, Robert Weismantel:
Mixed-integer sets from two rows of two adjacent simplex bases. Math. Program. 124(1-2): 455-480 (2010) - Kurt M. Anstreicher, Samuel Burer:
Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124(1-2): 33-43 (2010) - Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel:
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124(1-2): 233-253 (2010) - Tristram Bogart, Annie Raymond, Rekha R. Thomas:
Small Chvátal Rank. Math. Program. 124(1-2): 45-68 (2010) - Immanuel M. Bomze, Florian Frommlet, Marco Locatelli:
Copositivity cuts for improving SDP bounds on the clique number. Math. Program. 124(1-2): 13-32 (2010) - Christoph Buchheim, Frauke Liers, Marcus Oswald:
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124(1-2): 513-535 (2010) - Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a real-world train-unit assignment problem. Math. Program. 124(1-2): 207-231 (2010) - Alberto Caprara, Adam N. Letchford:
New techniques for cost sharing in combinatorial optimization games. Math. Program. 124(1-2): 93-118 (2010) - Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. Math. Program. 124(1-2): 413-439 (2010) - José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi:
Approximating a class of combinatorial problems with rational objective function. Math. Program. 124(1-2): 255-269 (2010) - Santanu S. Dey, Laurence A. Wolsey:
Two row mixed-integer cuts via lifting. Math. Program. 124(1-2): 143-174 (2010) - Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette:
A note on the selection of Benders' cuts. Math. Program. 124(1-2): 175-182 (2010) - Oktay Günlük, Jeff T. Linderoth:
Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1-2): 183-205 (2010) - Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey:
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - Konstantinos Kaparis, Adam N. Letchford:
Separation algorithms for 0-1 knapsack polytopes. Math. Program. 124(1-2): 69-91 (2010) - Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses:
Efficient and fair routing for mesh networks. Math. Program. 124(1-2): 285-316 (2010) - Ali Ridha Mahjoub, S. Thomas McCormick:
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124(1-2): 271-284 (2010) - Maren Martens, S. Thomas McCormick, Maurice Queyranne:
Separation, dimension, and facet algorithms for node flow polyhedra. Math. Program. 124(1-2): 317-348 (2010) - Jean François Maurras:
Note on separation from membership, and folklore. Math. Program. 124(1-2): 7-11 (2010) - Antoine Musitelli:
Recognizing binet matrices. Math. Program. 124(1-2): 349-381 (2010) - Alain Prodon, Scott DeNegre, Thomas M. Liebling:
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems. Math. Program. 124(1-2): 119-141 (2010) - Anureet Saxena, Pierre Bonami, Jon Lee:
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1-2): 383-411 (2010) - Martin Skutella, Alexia Weber:
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency. Math. Program. 124(1-2): 441-454 (2010) - Mohit Tawarmalani, Jean-Philippe P. Richard, Kwanghun Chung:
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1-2): 481-512 (2010)
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-10-07 18:53 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