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

Autor principal:	Cook, William, 1957-
Autor Corporativo:	ebrary, Inc
Formato:	Electrónico eBook
Lenguaje:	inglés
Publicado:	Princeton : Princeton University Press, 2012.
Materias:	Traveling salesman problem. Computational complexity. Electronic books.
Acceso en línea:	An electronic book accessible through the World Wide Web; click to view
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!