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

Full beskrivning

Bibliografiska uppgifter

Huvudupphov:	Cook, William, 1957-
Institutionellt upphov:	ebrary, Inc
Materialtyp:	Elektronisk E-bok
Språk:	engelska
Utgiven:	Princeton : Princeton University Press, 2012.
Ämnen:	Traveling salesman problem. Computational complexity. Electronic books.
Länkar:	An electronic book accessible through the World Wide Web; click to view
Taggar:	Lägg till en tagg Inga taggar, Lägg till första taggen!