×

The sharpest cut. The impact of Manfred Padberg and his work. Papers from the workshop in honor of Manfred Padberg’s 60th birthday, Berlin, Germany, October 11–13, 2001. (English) Zbl 1050.90003

MPS/SIAM Series on Optimization 4. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). Philadelphia, PA: MPS, Mathematical Programming Society (ISBN 0-89871-552-0/hbk; 978-0-89871-880-5/ebook). xi, 380 p. (2004).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. Part VII: Appendix, Chapter 20: Reflections, contains the banquet speeches by Egon Balas, Claude Berge, and Harold Kuhn
Indexed articles:
Manfred Padberg (Curriculum vitae and selected publications), 3-5 [Zbl 1077.01514]
Wolsey, Laurence, Time for old and new faces, 7-15 [Zbl 1077.01536]
Borndörfer, Ralf, Combinatorial packing problems, 19-32 [Zbl 1107.90032]
Conforti, Michele; Cornuéjols, Gérard; Zambelli, Giacomo, Bicolorings and equitable bicolorings of matrices, 33-37 [Zbl 1152.90576]
Fonlupt, Jean, The clique-rank of 3-chromatic perfect graphs, 39-49 [Zbl 1073.05031]
Gentile, Claudio; Haus, Utz-Uwe; Köppe, Matthias; Rinaldi, Giovanni; Weismantel, Robert, On the way to perfection: primal operations for stable sets in graphs, 51-76 [Zbl 1095.90080]
Wagler, Annegret K., Relaxing perfectness: Which graphs are “almost” perfect?, 77-96 [Zbl 1072.05026]
Grötschel, Martin, Cardinality homogeneous set systems, cycles in matroids, and associated polytopes, 99-120 [Zbl 1152.90578]
Kerivin, Hervé; Mahjoub, Ali Ridha; Nocq, Charles, \((1,2)\)-survivable networks: facets and branch-and-cut, 121-152 [Zbl 1095.90118]
Naddef, Denis, The domino inequalities for the symmetric traveling salesman problem, 153-172 [Zbl 1095.90119]
Oswald, Marcus; Reinelt, Gerhard, Computing optimal consecutive ones matrices, 173-183 [Zbl 1101.90085]
Chandru, Vijay; Rao, M. Rammohan; Swaminathan, Ganesh, Protein folding on lattices: An integer programming approach, 185-196 [Zbl 1100.92018]
Kaibel, Volker, On the expansion of graphs of 0/1-polytopes, 199-216 [Zbl 1079.52008]
Ziegler, Günter M., Typical and extremal linear programs, 217-230 [Zbl 1152.90531]
Helmberg, Christoph, A cutting plane algorithm for large scale semidefinite relaxations, 233-256 [Zbl 1136.90431]
Laurent, Monique, Semidefinite relaxations for max-cut, 257-290 [Zbl 1152.90556]
Brixius, Nathan W.; Anstreicher, Kurt M., The Steinberg wiring problem, 293-307 [Zbl 1107.90429]
Bixby, Robert E.; Fenelon, Mary; Gu, Zonghao; Rothberg, Ed; Wunderling, Roland, Mixed-integer programming: a progress report, 309-325 [Zbl 1152.90542]
Mutzel, Petra; Jünger, Michael, Graph drawing: exact optimization helps!, 327-352 [Zbl 1107.90458]

MSC:

90-06 Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
90C27 Combinatorial optimization
90C35 Programming involving graphs or networks
90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut
00B30 Festschriften

Biographic References:

Padberg, Manfred
PDFBibTeX XMLCite
Full Text: DOI