Imaxe de Portada

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...

Descrición completa

Gardado en:
Detalles Bibliográficos
Autor Principal: Cook, William, 1957-
Autor Corporativo: ebrary, Inc
Formato: Electrónico eBook
Idioma:inglés
Publicado: Princeton : Princeton University Press, 2012.
Subjects:
Traveling salesman problem.
Computational complexity.
Electronic books.
Acceso en liña:An electronic book accessible through the World Wide Web; click to view
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Títulos similares

Títulos similares