Abstract is missing.
- Surprise Session for Jack Edmonds, Eureka - You Shrink! 1-10 [doi]
- Submodular Functions, Matroids, and Certain PolyhedraJack Edmonds. 11-26 [doi]
- Matching: A Well-Solved Class of Integer Linear ProgramsJack Edmonds, Ellis L. Johnson. 27-30 [doi]
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJack Edmonds, Richard M. Karp. 31-33 [doi]
- Connected MatchingsKathie Cameron. 34-38 [doi]
- Hajós Construction and PolytopesReinhardt Euler. 39-47 [doi]
- Algorithmic Characterization of Bipartite b-Matching and Matroid IntersectionRobert T. Firla, Bianca Spille, Robert Weismantel. 48-63 [doi]
- Solving Real-World ATSP Instances by Branch-and-CutMatteo Fischetti, Andrea Lodi, Paolo Toth. 64-77 [doi]
- The Bundle Method for Hard Combinatorial Optimization ProblemsGerald Gruber, Franz Rendl. 78-88 [doi]
- The One-Commodity Pickup-and-Delivery Travelling Salesman ProblemHipólito Hernández-Pérez, Juan José Salazar González. 89-104 [doi]
- Reconstructing a Simple Polytope from Its GraphVolker Kaibel. 105-118 [doi]
- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 ProgrammingAdam N. Letchford, Andrea Lodi. 119-133 [doi]
- A Procedure of Facet Composition for the Symmetric Traveling Salesman PolytopeJean François Maurras, Viet Hung Nguyen. 134-146 [doi]
- Constructing New Facets of the Consecutive Ones PolytopeMarcus Oswald, Gerhard Reinelt. 147-157 [doi]
- A Simplex-Based Algorithm for 0-1 Mixed Integer ProgrammingJean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser. 158-170 [doi]
- Mixed-Integer Value Functions in Stochastic ProgrammingRüdiger Schultz. 171-184 [doi]
- Exact Algorithms for NP-Hard Problems: A SurveyGerhard J. Woeginger. 185-208 [doi]