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ó completa

Guardat en:
Dades bibliogràfiques
Autor principal: Cook, William, 1957-
Autor corporatiu: ebrary, Inc
Format: Electrònic eBook
Idioma:anglès
Publicat: Princeton : Princeton University Press, 2012.
Matèries:
Accés en línia:An electronic book accessible through the World Wide Web; click to view
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars