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

Fuld beskrivelse

Saved in:
Bibliografiske detaljer
Hovedforfatter: Cook, William, 1957-
Institution som forfatter: ebrary, Inc
Format: Electronisk eBog
Sprog:engelsk
Udgivet: Princeton : Princeton University Press, 2012.
Fag:
Online adgang:An electronic book accessible through the World Wide Web; click to view
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!