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

J??nger, Michael; Naddef, Denis

 
9783540428770: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241, Band 2241)
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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2008
Sprache
Englisch
ISBN 10 
3540428771
ISBN 13 
9783540428770
Einband
Taschenbuch
Anzahl der Seiten
320
Kontakt zum Hersteller
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Deutschland