In pursuit of the traveling salesman : mathematics at the limits of computation /

Mostrar otras versiones (2)

"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied so...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Cook, William, 1957- (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Princeton : Princeton University Press, 2012.
Temas:
Traveling salesman problem.
Computational complexity.
Vehicle routing problem.
Problèmes de tournées.
Complexité de calcul (Informatique)
MATHEMATICS > Graphic Methods.
MATHEMATICS > General.
Vehicle routing problem
Computational complexity
Traveling salesman problem
Acceso en línea:Texto completo
Search Result 1
In Pursuit of the Traveling Salesman : Mathematics at the Limits of Computation /
por Cook, William, 1957-
Publicado 2012
Texto completo
Electrónico eBook
Search Result 2
In pursuit of the traveling salesman : mathematics at the limits of computation /
por Cook, William, 1957-
Publicado 2012
Texto completo
Electrónico eBook
Mostrar todas las versiones(3)

Ejemplares similares