Combinatorial Optimization — Eureka, You Shrink! [electronic resource] : Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, March 5–9, 2001 Revised Papers / edited by Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi.

“Eureka — You Skrink!” -- “Eureka — You Shrink!” -- Submodular Functions, Matroids, and Certain Polyhedra -- Matching: A Well-Solved Class of Integer Linear Programs -- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems -- Connected Matchings -- Hajós’ Construction and Polytopes -- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection -- Solving Real-World ATSP Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem -- Reconstructing a Simple Polytope from Its Graph -- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming -- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope -- Constructing New Facets of the Consecutive Ones Polytope -- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming -- Mixed-Integer Value Functions in Stochastic Programming -- Exact Algorithms for NP-Hard Problems: A Survey.