Combinatorial Optimization 2001: Aussois, France

Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi (Eds.): 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 BibTeX

@proceedings{DBLP:conf/aussois/2001,
  editor    = {Michael J{\"u}nger and
               Gerhard Reinelt and
               Giovanni Rinaldi},
  title     = {Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated
               to Jack Edmonds, 5th International Workshop, Aussois, France,
               March 5-9, 2001, Revised Papers},
  booktitle = {Combinatorial Optimization},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2570},
  year      = {2003},
  isbn      = {3-540-00580-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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