Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions: 2241 (Lecture Notes in Computer Science) - Softcover

J??nger, Michael; Naddef, Denis

Softcover

ISBN 10: 3540428771 ISBN 13: 9783540428770

Verlag: Springer, 2008

Inhaltsangabe

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2008
• Sprache: Englisch
• ISBN 10: 3540428771
• ISBN 13: 9783540428770
• Einband: Tapa blanda
• Anzahl der Seiten: 320
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Deutschland