Facets of Combinatorial Optimization Festschrift for Martin Grötschel /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Jünger, Michael (Επιμελητής έκδοσης), Reinelt, Gerhard (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
• Θέματα: Mathematics.; Computer science > Mathematics.; Applied mathematics.; Engineering mathematics.; Algorithms.; Mathematical models.; Mathematical optimization.; Optimization.; Applications of Mathematics.; Mathematical Modeling and Industrial Mathematics.; Discrete Mathematics in Computer Science.

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

Πίνακας περιεχομένων:

• 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 .