Facets of Combinatorial Optimization: Festschrift for Martin Grötschel

Martin Grötschel - a tribute: M.Jünger and G.Reinelt.- Facets and rank of integer polyhedra: M.Padberg.- Constructing extended formulations from reflection relations: V.Kaibel and K.Pashkovich -- Exact algorithms for combinatorial optimization problems with submodular objective functions: F.Bauman...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Weitere Verfasser: Jünger, Michael (HerausgeberIn) , Reinelt, Gerhard (HerausgeberIn)
Dokumenttyp: Sammelband
Sprache:Englisch
Veröffentlicht: Berlin, Heidelberg s.l. Springer Berlin Heidelberg Imprint: Springer 2013
Schriftenreihe:SpringerLink Bücher
Volumes / Articles: Show Volumes / Articles.
DOI:10.1007/978-3-642-38189-8
Schlagworte:
Online-Zugang:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/978-3-642-38189-8
Resolving-System, lizenzpflichtig, Volltext: http://dx.doi.org/10.1007/978-3-642-38189-8
Cover: https://swbplus.bsz-bw.de/bsz392247666cov.jpg
Verlag, Zentralblatt MATH, Inhaltstext: https://zbmath.org/?q=an:1282.90010
Volltext
Verfasserangaben:Michael Jünger; Gerhard Reinelt eds.

MARC

LEADER 00000cam a22000002c 4500
001 1652959025
003 DE-627
005 20250524182637.0
007 cr uuu---uuuuu
008 130814s2013 gw |||||o 00| ||eng c
020 |a 9783642381898  |9 978-3-642-38189-8 
024 7 |a 10.1007/978-3-642-38189-8  |2 doi 
035 |a (DE-627)1652959025 
035 |a (DE-576)392247666 
035 |a (DE-599)BSZ392247666 
035 |a (OCoLC)858012067 
035 |a (ZBM)1282.90010 
035 |a (DE-627-1)03980335X 
035 |a (DE-He213)978-3-642-38189-8 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
050 0 |a QA402.5-402.6 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a PBU  |2 bicssc 
072 7 |a MAT042000  |2 bisacsh 
082 0 |a 519.6 
084 |a 28  |2 sdnb 
084 |a 27  |2 sdnb 
084 |a SK 890  |q SEPA  |2 rvk  |0 (DE-625)rvk/143267: 
084 |a *90-06  |2 msc 
084 |a 90C27  |2 msc 
084 |a 90C11  |2 msc 
084 |a 90C90  |2 msc 
084 |a 05-06  |2 msc 
084 |a 05C20  |2 msc 
084 |a 05C70  |2 msc 
084 |a 05C90  |2 msc 
084 |a 00B15  |2 msc 
084 |a 00B30  |2 msc 
084 |a 01A70  |2 msc 
084 |a 31.12  |2 bkl 
084 |a 31.80  |2 bkl 
100 1 |a Jünger, Michael  |e Hrsg.  |0 (DE-588)170472418  |0 (DE-627)060567589  |0 (DE-576)131357174  |4 edt 
245 1 0 |a Facets of Combinatorial Optimization  |b Festschrift for Martin Grötschel  |c Michael Jünger; Gerhard Reinelt eds. 
264 1 |a Berlin, Heidelberg  |a s.l.  |b Springer Berlin Heidelberg  |b Imprint: Springer  |c 2013 
300 |a Online-Ressource (XVII, 506 p. 245 illus., 162 illus. in color, online resource) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 0 |a SpringerLink  |a Bücher 
500 |a Description based upon print version of record 
505 8 |a Martin Grötschel - a tribute: M.Jünger and G.Reinelt.- Facets and rank of integer polyhedra: M.Padberg.- Constructing extended formulations from reflection relations: V.Kaibel and K.Pashkovich.-Exact algorithms for combinatorial optimization problems with submodular objective functions: F.Baumann, S.Berckey, and C.BuchheimSolving k-way graph partitioning problems to optimality: The impact of semidefinite relaxations and the bundle method: M.F. Anjos, B.Ghaddar, L.Hupp, F.Liers, and A.Wiegele -- Mirror-descent methods in mixed-integer convex optimization: M.Baes, T.Oertel, Ch.Wagner, and R.Weismantel -- On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control: M.Jung, Ch.Kirches, and S.Sager -- Beyond perfection: computational results for superclasses: A.Pecher and A.Wagler -- Algorithms for junctions in acyclic graphs: C.E. Ferreira and A.J.P. Franco -- A primal heuristic for nonsmooth mixed integer nonlinear optimization: M.Schmidt, M.C. Steinbach, and B.M. Willert -- Flow-Over-Flow Models and an Application to the Scheduling and Routing of Fly-in Safari Planes: A.Fügenschuh, G.Nemhauser, and Y.Zeng -- How Many Steiner Terminals Can You Connect in 20 Years?: R.Borndörfer, N.-D.Hoang, M.Karbstein, Th.Koch, and A.Martin -- Robust heaviest connected subgraphs in networks: E.Alvarez Miranda, I.Ljubic, and P.Mutzel.- Algorithms for scheduling sensors to maximize coverage time: R.da Ponte Barbosa and Y.Wakabayashi -- From vertex-telecenters to subtree-telecenters: Z.Win and C.Kyi Than -- A new algorithm for MINLP applied to gas transport energy cost minimization: B.Geißler, A.Morsi, and L.Schewe -- Progress in academic computational integer programming: Th.Koch, A.Martin, and M.E. Pfetsch -- Mixed Integer Programming: Analyzing 12 Years of Progress: T.Achterberg and R.Wunderling . 
520 |a Martin Grötschel - a tribute: M.Jünger and G.Reinelt.- Facets and rank of integer polyhedra: M.Padberg.- Constructing extended formulations from reflection relations: V.Kaibel and K.Pashkovich -- Exact algorithms for combinatorial optimization problems with submodular objective functions: F.Baumann, S.Berckey, and C.Buchheim -- Solving k-way graph partitioning problems to optimality: The impact of semidefinite relaxations and the bundle method: M.F. Anjos, B.Ghaddar, L.Hupp, F.Liers and A.Wiegele -- Mirror-descent methods in mixed-integer convex optimization: M.Baes, T.Oertel, Ch.Wagner and R.Weismantel -- On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control: M.Jung, Ch.Kirches, and S.Sager -- Beyond perfection: computational results for superclasses: A.Pecher and A.Wagler -- Algorithms for junctions in acyclic graphs: C.E. Ferreira and A.J.P. Franco -- A primal heuristic for nonsmooth mixed integer nonlinear optimization: M.Schmidt, M.C. Steinbach, and B.M. Willert -- Flow-Over-Flow Models and an Application to the Scheduling and Routing of Fly-in Safari Planes: A.Fügenschuh, G.Nemhauser, and Y.Zeng -- How Many Steiner Terminals Can You Connect in 20 Years?: R.Borndörfer, N -- D.Hoang, M.Karbstein, Th.Koch, and A.Martin -- Robust heaviest connected subgraphs in networks: E.Alvarez Miranda, I.Ljubic, and P.Mutzel.- Algorithms for scheduling sensors to maximize coverage time: R.da Ponte Barbosa and Y.Wakabayashi -- From vertex-telecenters to subtree-telecenters: Z.Win and C.Kyi Than -- A new algorithm for MINLP applied to gas transport energy cost minimization: B.Geißler, A.Morsi and L.Schewe -- Progress in academic computational integer programming: Th.Koch, A.Martin, and M.E. Pfetsch -- Mixed Integer Programming: Analyzing 12 Years of Progress: T.Achterberg and R.Wunderling . 
520 |a 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. 
650 0 |a Computational complexity 
650 0 |a Engineering mathematics. 
650 0 |a Applied mathematics. 
650 0 |a Computer science—Mathematics. 
650 0 |a Mathematics 
650 0 |a Mathematical models. 
650 0 |a Computer science 
650 0 |a Discrete mathematics. 
650 0 |a Algorithms 
650 0 |a Mathematical optimization 
655 7 |a Aufsatzsammlung  |0 (DE-588)4143413-4  |0 (DE-627)105605727  |0 (DE-576)209726091  |2 gnd-content 
689 0 0 |d s  |0 (DE-588)4031826-6  |0 (DE-627)106263900  |0 (DE-576)208994432  |a Kombinatorische Optimierung  |2 gnd 
689 0 |5 DE-101 
689 1 0 |d s  |0 (DE-588)4031826-6  |0 (DE-627)106263900  |0 (DE-576)208994432  |a Kombinatorische Optimierung  |2 gnd 
689 1 |5 (DE-627) 
700 1 |a Reinelt, Gerhard  |e Hrsg.  |0 (DE-588)101987113X  |0 (DE-627)691042861  |0 (DE-576)358936187  |4 edt 
776 1 |z 9783642381881 
776 0 8 |i Erscheint auch als  |n Druck-Ausgabe  |t Facets of combinatorial optimization  |d Berlin : Springer, 2013  |h XVII, 506 S  |w (DE-627)769311482  |w (DE-576)394075102  |z 9783642381881 
856 4 0 |u https://doi.org/10.1007/978-3-642-38189-8  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-38189-8  |x Resolving-System  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz392247666cov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20140210114254  |3 Cover 
856 4 2 |u https://zbmath.org/?q=an:1282.90010  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
889 |w (DE-627)757303870 
912 |a ZDB-2-SXMS  |b 2013 
912 |a ZDB-2-SMA  |b 2013 
912 |a ZDB-2-SEB  |b 2013 
935 |h GBV  |i ExPruef 
936 r v |a SK 890  |b Ganzzahlige und kombinatorische Optimierung, Graphentheorie  |k Mathematik  |k Monografien  |k Ganzzahlige und kombinatorische Optimierung, Graphentheorie  |0 (DE-627)1271487969  |0 (DE-625)rvk/143267:  |0 (DE-576)201487969 
936 b k |a 31.12  |j Kombinatorik  |j Graphentheorie  |q SEPA  |0 (DE-627)106418963 
936 b k |a 31.80  |j Angewandte Mathematik  |q SEPA  |0 (DE-627)106419005 
951 |a BO 
990 |a Kombinatorische Optimierung 
990 |a Kombinatorische Optimierung 
992 |a 20220926 
993 |a Book 
994 |a 2013 
998 |g 101987113X  |a Reinelt, Gerhard  |m 101987113X:Reinelt, Gerhard  |d 110000  |d 110300  |e 110000PR101987113X  |e 110300PR101987113X  |k 0/110000/  |k 1/110000/110300/  |p 2  |y j 
999 |a KXP-PPN1652959025  |e 4191586343 
BIB |a Y 
SPR |a Y 
JSO |a {"origin":[{"publisherPlace":"Berlin, Heidelberg ; s.l.","dateIssuedKey":"2013","publisher":"Springer Berlin Heidelberg ; Imprint: Springer","dateIssuedDisp":"2013"}],"title":[{"title":"Facets of Combinatorial Optimization","subtitle":"Festschrift for Martin Grötschel","title_sort":"Facets of Combinatorial Optimization"}],"id":{"doi":["10.1007/978-3-642-38189-8"],"eki":["1652959025"],"isbn":["9783642381898"]},"person":[{"roleDisplay":"Hrsg.","display":"Jünger, Michael","role":"edt","family":"Jünger","given":"Michael"},{"given":"Gerhard","family":"Reinelt","role":"edt","display":"Reinelt, Gerhard","roleDisplay":"Hrsg."}],"name":{"displayForm":["Michael Jünger; Gerhard Reinelt eds."]},"physDesc":[{"extent":"Online-Ressource (XVII, 506 p. 245 illus., 162 illus. in color, online resource)"}],"type":{"media":"Online-Ressource","bibl":"book"},"note":["Description based upon print version of record"],"language":["eng"],"recId":"1652959025"} 
SRT |a FACETSOFCO2013