The Sharpest Cut: The Impact of Manfred Padberg and His Work

Part I: Manfred Padberg: Curriculum Vitae and Survey of His Work
1. Manfred Padberg: Curriculum Vitae
2. Time for Old and New Faces, by Laurence Wolsey

Part II: Packing, Stable Sets, and Perfect Graphs
3. Combinatorial Packing Problems, by Ralf Borndörfer
4. Bicolorings and Equitable Bicolorings of Matrices, by Michele Conforti^Gérard Cornuéjols^Giacomo Zambelli
5. The Clique-Rank of 3-Chromatic Perfect Graphs, by Jean Fonlupt
6. On the Way to Perfection: Primal Operations for Stable Sets in Graphs, by Claudio Gentile^Utz-Uwe Haus^Matthias Köppe^Giovanni Rinaldi^Robert Weismantel
7. Relaxing Perfectness: Which Graphs Are "Almost" Perfect?, by Annegret K. Wagler

Part III: Polyhedral Combinatorics
8. Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes, by Martin Grötchel
9. (1,2)-Survivable Networks: Facets and Branch-and-Cut, by Hervé Kerivin^ Ali Ridha Mahjoub^Charles Nocq
10. The Domino Inequalities for the Symmetric Traveling Salesman Problem, by Denis Naddef
11. Computing Optimal Consecutive Ones Matrices, by Marcus Oswald^Gerhard Reinelt
12. Protein Folding on Lattices: An Integer Programming Approach, by Vijay Chandru^M. Rammohan Rao^Ganesh Swaminathan

Part IV: General Polytopes
13. On the Expansion of Graphs of 0/1-Polytopes, by Volker Kaibel
14. Typical and Extremal Linear Programs, by Günter M. Ziegler

Part V: Semidefinite Programming
15. A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations, by Christoph Helmberg
16. Semidefinite Relaxations for Max-Cut, by Monique Laurent

Part VI: Computation
17. The Steinberg Wiring Problem, by Nathan W. Bixius^Kurt M. Anstreicher
18. Mixed-Integer Programming: A Progress Report, by Robert E. Bixby^Mary Fenelon^Zonghao Gu^Ed Rothberg^Roland Wunderling
19. Graph Drawing: Exact Optimization Helps!, by Petra Mutzel^Michael Jünger

Part VII: Appendix
20. Reflections

Index