Остановите войну!
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 19 matches
- 2004
- Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, Roland Wunderling:
Mixed-Integer Programming: A Progress Report. The Sharpest Cut 2004: 309-325 - Ralf Borndörfer:
Combinatorial Packing Problems. The Sharpest Cut 2004: 19-32 - Nathan W. Brixius, Kurt M. Anstreicher:
The Steinberg Wiring Problem. The Sharpest Cut 2004: 293-307 - Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan:
Protein Folding on Lattices: An Integer Programming Approach. The Sharpest Cut 2004: 185-196 - Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Bicolorings and Equitable Bicolorings of Matrices. The Sharpest Cut 2004: 33-37 - Jean Fonlupt:
The Clique-Rank of 3-Chromatic Perfect Graphs. The Sharpest Cut 2004: 39-49 - Claudio Gentile, Utz-Uwe Haus, Matthias Köppe, Giovanni Rinaldi, Robert Weismantel:
On the Way to Perfection: Primal Operations for Stable Sets in Graphs. The Sharpest Cut 2004: 51-76 - Martin Grötschel:
Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes. The Sharpest Cut 2004: 99-120 - Christoph Helmberg:
A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations. The Sharpest Cut 2004: 233-256 - Volker Kaibel:
On the Expansion of Graphs of 0/1-Polytopes. The Sharpest Cut 2004: 199-216 - Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq:
(1, 2)-Survivable Networks: Facets and Branch-and-Cut. The Sharpest Cut 2004: 121-152 - Monique Laurent:
Semidefinite Relaxations for Max-Cut. The Sharpest Cut 2004: 257-290 - Petra Mutzel, Michael Jünger:
Graph Drawing: Exact Optimization Helps! The Sharpest Cut 2004: 327-352 - Denis Naddef:
The Domino Inequalities for the Symmetric Traveling Salesman Problem. The Sharpest Cut 2004: 153-172 - Marcus Oswald, Gerhard Reinelt:
Computing Optimal Consecutive Ones Matrices. The Sharpest Cut 2004: 173-183 - Annegret Katrin Wagler:
Relaxing Perfectness: Which Graphs Are "Almost" Perfect? The Sharpest Cut 2004: 77-96 - Laurence A. Wolsey:
Time for Old and New Faces. The Sharpest Cut 2004: 7-15 - Günter M. Ziegler:
Typical and Extremal Linear Programs. The Sharpest Cut 2004: 217-230 - Martin Grötschel:
The Sharpest Cut. MPS-SIAM series on optimization 4, SIAM 2004, ISBN 978-0-89871-552-1 [contents]
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-06-05 22:07 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