 |
|
|
Item Details
| Title:
|
FACETS OF COMBINATORIAL OPTIMIZATION
FESTSCHRIFT FOR MARTIN GROTSCHEL |
| By: |
Michael Junger (Editor), Gerhard Reinelt (Editor) |
| Format: |
Paperback |
| List price:
|
£96.50 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3662523698 |
| ISBN 13: |
9783662523698 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
23 August, 2016 |
| Edition: |
Softcover reprint of the original 1st ed. 2013 |
| Pages: |
506 |
| Description: |
This book honors Martin Grotschel: scientist, teacher and activist in mathematics, with chapters by collaborators, including his doctoral descendents, celebrating Grotschel's work in theory, applications and computation in combinatorial optimization. |
| Synopsis: |
Martin Grotschel 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 Grotschel'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 Grotschel 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 Grotschel who has set standards in theory, computation and applications. |
| Illustrations: |
162 Illustrations, color; 83 Illustrations, black and white; XVII, 506 p. |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|