The sharpest cut : the impact of Manfred Padberg and his work / edited by Martin Grötschel.

Format:

Book

Contributor:

Padberg, M. W.

Grötschel, Martin.

Society for Industrial and Applied Mathematics.

Series:

MPS-SIAM series on optimization.

MPS-SIAM series on optimization

Language:

English

Subjects (All):

Combinatorial optimization--Congresses.

Combinatorial optimization.

Programming (Mathematics)--Congresses.

Programming (Mathematics).

Genre:

Festschriften.

Physical Description:

1 electronic text (xi, 380 p.) : ill., digital file.

Other Title:

Impact of Manfred Padberg and his work.

Place of Publication:

Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 2004.

Language Note:

English

System Details:

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.

Summary:

This title is written in honor of Manfred Padberg, who has made fundamental contributions to both the theoretical and computational sides of integer programming and combinatorial optimization. This outstanding collection presents recent results in these areas that are closely connected to Padberg's research. His deep commitment to the geometrical approach to combinatorial optimization can be felt throughout this volume; his search for increasingly better and computationally efficient cutting planes gave rise to its title. The peer-reviewed papers contained here are based on invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday. Grouped by topic (packing, stable sets, and perfect graphs; polyhedral combinatorics; general polytopes; semidefinite programming; computation), many of the papers set out to solve challenges set forth in Padberg's work. The book also shows how Padberg's ideas on cutting planes have influenced modern commercial optimization software.

Contents:

1. Manfred Padberg : curriculum vitae

2. Time for old and new faces / L. Wolsey

Pt. 2. Packing, stable sets, and perfect graphs. 3. Combinatorial packing problems / R. Borndörfer

4. Bicolorings and equitable bicolorings of matrices / M. Conforti, G. Cornuéjols and G. Zambelli

5. The clique-rank of 3-chromatic perfect graphs / J. Fonlupt

6. On the way to perfection : primal operations for stable sets in graphs / C. Gentile, U.-U. Haus, M. Köppe, G. Rinaldi, R. Weismantel

7. Relaxing perfectness : which graphs are "almost" perfect? / A.K. Wagler

Pt. 3. Polyhedral combinatorics. 8. Cardinality homogeneous set systems, cycles in matroids, and associated polytopes / M. Grötschel

9. (1,2)-survivable networks : facets and branch-and-cut / H. Kerivin, A.R. Mahjoub, and C. Nocq

10. The domino inequalities for the symmetric traveling salesman problem / C. Naddef

11. Computing optimal consecutive ones matrices / M. Oswald and G. Reinelt

12. Protein folding on lattices : an integer programming approach / V. Chandru, M.R. Rao, and G. Swaminathan

Pt. 4. General polytopes. 13. On the expansion of graphs of 0/1-polytopes / V. Kaibel

14. Typical and extremal linear programs / G.M. Ziegler

Pt. 5. Semidefinite programming. 15. A cutting plane algorithm for large scale semidefinite relaxations / C. Helmberg

16. Semidefinite relaxations for max-cut / M. Laurent

Pt. 6. Computation

17. The Steinberg wiring problem / N.W. Brixius and K.M. Anstreicher

18. Mixed-integer programming : a progress report / R.E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling

19. Graph drawing : exact optimization helps! / P. Muntzel and M. Jünger

Pt. 7. Appendix

20. Dinner speeches.

Notes:

Bibliographic Level Mode of Issuance: Monograph

Includes bibliographical references and index.

Description based on title page of print version.

ISBN:

0-89871-880-5

Publisher Number:

MP04 siam

MP04 SIAM