Facets of Combinatorial Optimization

Festschrift for Martin Grötschel

Nonfiction, Science & Nature, Mathematics, Applied, Computers, Programming
Cover of the book Facets of Combinatorial Optimization by , Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9783642381898
Publisher: Springer Berlin Heidelberg Publication: July 3, 2013
Imprint: Springer Language: English
Author:
ISBN: 9783642381898
Publisher: Springer Berlin Heidelberg
Publication: July 3, 2013
Imprint: Springer
Language: English

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 general mixed 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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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 general mixed 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.

More books from Springer Berlin Heidelberg

Cover of the book Controversies in Acute Pancreatitis by
Cover of the book Fungal Associations by
Cover of the book Hygiene in Kindertagesstätten by
Cover of the book Tree and Forest Measurement by
Cover of the book Wiederholungs- und Vertiefungskurs Strafrecht by
Cover of the book Akupunktur bei psychischen Erkrankungen by
Cover of the book Optical Guided-wave Chemical and Biosensors I by
Cover of the book Lehrbuch der ökonomischen Analyse des Zivilrechts by
Cover of the book Earth System Modelling - Volume 4 by
Cover of the book Bio-inspired Asymmetric Design and Building of Biomimetic Smart Single Nanochannels by
Cover of the book Computer Science and Educational Software Design by
Cover of the book Leptospira and Leptospirosis by
Cover of the book Learning Cardiac Imaging by
Cover of the book Insider Dealing and Criminal Law by
Cover of the book Cantor und die Franzosen by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy