Editors:
- Festschrift for outstanding researcher
- A volume celebrating the work of the eminent mathematician Martin Grötschel, in honor of his 65th birthday
- Presents papers based on talks by Grötschel’s teachers, colleagues and students
- Hot topics in discrete optimization
- Covers important concepts in Combinatorial Optimization: Mirror-descent methods in mixed-integer convex optimization; Beyond perfection: computational results for superclasses; Algorithms for junctions in acyclic graphs and Mixed Integer Programming: Analyzing 12 Years of Progress
- Includes supplementary material: sn.pub/extras
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (19 chapters)
-
Front Matter
-
Martin Grötschel—Activist in Optimization
-
Front Matter
-
-
Contribution by a Very Special Predecessor of Martin Grötschel
-
Front Matter
-
-
Martin Grötschel’s Doctoral Descendants
-
Front Matter
-
-
Contributions by Martin Grötschel’s Doctoral Descendants
-
Front Matter
-
About this book
Martin Grötschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday on September 10, 2013. Martin Grötschel’s doctoral descendant tree 1983–2012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren and 2 great-great-grandchildren, a total of 139 doctoral descendants.
This book starts with a personal tribute to Martin Grötschel by the editors (Part I), a contribution by his very special “predecessor” Manfred Padberg on “Facets and Rank of Integer Polyhedra” (Part II), and the doctoral descendant tree 1983–2012 (Part III). The core of this book (Part IV) contains 16 contributions, each of which is coauthored by at least one doctoral descendant.
The sequence of the articles starts with contributions to the theory of mathematical optimization, including polyhedral combinatorics, extended formulations, mixed-integer convex optimization, super classes of perfect graphs, efficient algorithms for subtree-telecenters, junctions in acyclic graphs and preemptive restricted strip covering, as well as efficient approximation of non-preemptive restricted strip covering.
Combinations of new theoretical insights with algorithms and experiments deal with network design problems, combinatorial optimization problems with submodular objective functions and more general mixed-integer nonlinear optimization problems. Applications include VLSI layout design, systems biology, wireless network design, mean-risk optimization and gas network optimization.
Computational studies include a semidefinite branch and cut approach for the max k-cut problem, mixed-integer nonlinear optimal control, and mixed-integer linear optimization for scheduling and routing of fly-in safari planes.
The two closing articles are devoted to computational advances in generalmixed integer linear optimization, the first by scientists working in industry, the second by scientists working in academia.
These articles reflect the “scientific facets” of Martin Grötschel who has set standards in theory, computation and applications.
Editors and Affiliations
-
Dept. of Computer Science, University of Cologne, Cologne, Germany
Michael Jünger
-
Dept. of Computer Science, University of Heidelberg, Heidelberg, Germany
Gerhard Reinelt
Bibliographic Information
Book Title: Facets of Combinatorial Optimization
Book Subtitle: Festschrift for Martin Grötschel
Editors: Michael Jünger, Gerhard Reinelt
DOI: https://doi.org/10.1007/978-3-642-38189-8
Publisher: Springer Berlin, Heidelberg
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2013
Hardcover ISBN: 978-3-642-38188-1Published: 14 July 2013
Softcover ISBN: 978-3-662-52369-8Published: 23 August 2016
eBook ISBN: 978-3-642-38189-8Published: 03 July 2013
Edition Number: 1
Number of Pages: XVII, 506
Number of Illustrations: 83 b/w illustrations, 162 illustrations in colour
Topics: Optimization, Applications of Mathematics, Algorithms, Mathematical Modeling and Industrial Mathematics, Discrete Mathematics in Computer Science