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

Description complète

Détails bibliographiques

Auteur principal:	Cook, William, 1957-
Collectivité auteur:	ebrary, Inc
Format:	Électronique eBook
Langue:	anglais
Publié:	Princeton : Princeton University Press, 2012.
Sujets:	Traveling salesman problem. Computational complexity. Electronic books.
Accès en ligne:	An electronic book accessible through the World Wide Web; click to view
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!