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 18 matches
- 2003
- Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers. Lecture Notes in Computer Science 2570, Springer 2003, ISBN 3-540-00580-3 [contents] - 2001
- Kathie Cameron:
Connected Matchings. Combinatorial Optimization 2001: 34-38 - Jack Edmonds:
Submodular Functions, Matroids, and Certain Polyhedra. Combinatorial Optimization 2001: 11-26 - Jack Edmonds, Ellis L. Johnson:
Matching: A Well-Solved Class of Integer Linear Programs. Combinatorial Optimization 2001: 27-30 - Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization 2001: 31-33 - Reinhardt Euler:
Hajós' Construction and Polytopes. Combinatorial Optimization 2001: 39-47 - Robert T. Firla, Bianca Spille, Robert Weismantel:
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. Combinatorial Optimization 2001: 48-63 - Matteo Fischetti, Andrea Lodi, Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77 - Gerald Gruber, Franz Rendl:
The Bundle Method for Hard Combinatorial Optimization Problems. Combinatorial Optimization 2001: 78-88 - Hipólito Hernández-Pérez, Juan José Salazar González:
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. Combinatorial Optimization 2001: 89-104 - Volker Kaibel:
Reconstructing a Simple Polytope from Its Graph. Combinatorial Optimization 2001: 105-118 - Adam N. Letchford, Andrea Lodi:
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Combinatorial Optimization 2001: 119-133 - Jean François Maurras, Viet Hung Nguyen:
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. Combinatorial Optimization 2001: 134-146 - Marcus Oswald, Gerhard Reinelt:
Constructing New Facets of the Consecutive Ones Polytope. Combinatorial Optimization 2001: 147-157 - Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. Combinatorial Optimization 2001: 158-170 - Rüdiger Schultz:
Mixed-Integer Value Functions in Stochastic Programming. Combinatorial Optimization 2001: 171-184 - Gerhard J. Woeginger:
Exact Algorithms for NP-Hard Problems: A Survey. Combinatorial Optimization 2001: 185-208 - Surprise Session for Jack Edmonds, "Eureka - You Shrink!". Combinatorial Optimization 2001: 1-10
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-11 23:13 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