default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorial Optimization 2001: Aussois, France
- 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 - Surprise Session for Jack Edmonds, "Eureka - You Shrink!". 1-10
- Jack Edmonds:
Submodular Functions, Matroids, and Certain Polyhedra. 11-26 - Jack Edmonds, Ellis L. Johnson:
Matching: A Well-Solved Class of Integer Linear Programs. 27-30 - Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. 31-33 - Kathie Cameron:
Connected Matchings. 34-38 - Reinhardt Euler:
Hajós' Construction and Polytopes. 39-47 - Robert T. Firla, Bianca Spille, Robert Weismantel:
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. 48-63 - Matteo Fischetti, Andrea Lodi, Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut. 64-77 - Gerald Gruber, Franz Rendl:
The Bundle Method for Hard Combinatorial Optimization Problems. 78-88 - Hipólito Hernández-Pérez
, Juan José Salazar González:
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. 89-104 - Volker Kaibel:
Reconstructing a Simple Polytope from Its Graph. 105-118 - Adam N. Letchford, Andrea Lodi:
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. 119-133 - Jean François Maurras, Viet Hung Nguyen:
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. 134-146 - Marcus Oswald, Gerhard Reinelt:
Constructing New Facets of the Consecutive Ones Polytope. 147-157 - Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser:
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. 158-170 - Rüdiger Schultz:
Mixed-Integer Value Functions in Stochastic Programming. 171-184 - Gerhard J. Woeginger:
Exact Algorithms for NP-Hard Problems: A Survey. 185-208
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.
last updated on 2024-12-12 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
