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

J??nger, Michael; Naddef, Denis

 
9783540428770: Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions: 2241 (Lecture Notes in Computer Science)
Tapa blanda
ISBN 10: 3540428771 ISBN 13: 9783540428770
Editorial: Springer, 2008

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2008
Idioma
Inglés
ISBN 10 
3540428771
ISBN 13 
9783540428770
Encuadernación
Tapa blanda
Número de páginas
320
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania