The Traveling Salesman Problem : a Computational Study.

Mostrar otras versiones (2)

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest rou...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Applegate, David L.
Otros Autores: Bixby, Robert E., Chvatal, Vasek, Cook, William J.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Princeton : Princeton University Press, 2011.
Colección:Princeton series in applied mathematics.
Temas:
Traveling salesman problem.
Problèmes de tournées.
MATHEMATICS > Graphic Methods.
MATHEMATICS > Applied.
Traveling salesman problem
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Frontmatter
  • Contents
  • Preface
  • Chapter 1. The Problem
  • Chapter 2. Applications
  • Chapter 3. Dantzig, Fulkerson, and Johnson
  • Chapter 4. History of TSP Computation
  • Chapter 5. LP Bounds and Cutting Planes
  • Chapter 6. Subtour Cuts and PQ-Trees
  • Chapter 7. Cuts from Blossoms and Blocks
  • Chapter 8. Combs from Consecutive Ones
  • Chapter 9. Combs from Dominoes
  • Chapter 10. Cut Metamorphoses
  • Chapter 11. Local Cuts
  • Chapter 12. Managing the Linear Programming Problems
  • Chapter 13. The Linear Programming Solver Chapter 14. Branching
  • Chapter 14. Branching
  • Chapter 15. Tour Finding
  • Chapter 16. Computation
  • Chapter 17. The Road Goes On
  • Bibliography
  • Index.

Ejemplares similares