Cargando…

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

"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:
Acceso en línea:Texto completo

Ejemplares similares