Facets of Combinatorial Optimization
Festschrift for Martin Grötschel
Our rough guess is there are 126,500 words in this book.
At a pace averaging 250 words per minute, this book will take 8 hours and 26 minutes to read. With a half hour per day, this will take 17 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Reinelt, Gerhard - Contributor
- SpringerLink (Online service) - Contributor
Publication
2013 - Springer Berlin Heidelberg, Germany
Language
English
Word Count
126,500 words, Guess
Page Count
506 pages
Physical Format
[electronic resource] :
Identifiers
- Open LibraryOL27038028M
- ISBN-139783642381898
- OCLC Control Numberfacetscombinator00jnge
Classifications
- DDC519.6
- LCCQA402.5-402.6
Description
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, superclasses 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.
Subjects
Other Editions
- Facets of Combinatorial Optimization: Festschrift for Martin Grötschel
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!