LEADER 03969nam  2200505 a 450 
001 9910438027203321
005 20200520144314.0
010   $a3-642-38189-8
024 7 $a10.1007/978-3-642-38189-8
035   $a(OCoLC)852686845
035   $a(MiFhGG)GVRL6VFX
035   $a(CKB)3710000000002584
035   $a(MiAaPQ)EBC1474382
035   $a(EXLCZ)993710000000002584
100   $a20130611d2013      uy         0
101 0 $aeng
135   $aurun|---uuuua
181   $ctxt
182   $cc
183   $acr
200 00$aFacets of combinatorial optimization $efestschrift for Martin Grotschel /$fMichael Junger, Gerhard Reinelt, editors
205   $a1st ed.
210   $aNew York $cSpringer$d2013
215   $a1 online resource (xvii, 506 pages) $cillustrations (some color), portrait
225 0 $aGale eBooks
300   $aDescription based upon print version of record.
311   $a3-642-38188-X 
320   $aIncludes bibliographical references.
327   $apt. I. Martin Grotschel : activist in optimization -- pt. II. Contribution by a very special predecessor of Martin Grotschel -- pt. III. Martin Grotschel's doctoral descendants -- pt. IV. Contributions by Martin Grotschel's doctoral descendants.
330   $aMartin 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.
606   $aCombinatorial optimization
615  0$aCombinatorial optimization.
676   $a003.3
676   $a519.6
676   $a519.64
701   $aJunger$b M$g(Michael)$01762381
701   $aReinelt$b G$g(Gerhard)$01220838
701   $aGrotschel$b Martin$042045
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910438027203321
996   $aFacets of combinatorial optimization$94202255
997   $aUNINA