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

Popoln opis

Bibliografske podrobnosti

Glavni avtor:	Cook, William, 1957-
Korporativna značnica:	ebrary, Inc
Format:	Elektronski eKnjiga
Jezik:	angleščina
Izdano:	Princeton : Princeton University Press, 2012.
Teme:	Traveling salesman problem. Computational complexity. Electronic books.
Online dostop:	An electronic book accessible through the World Wide Web; click to view
Oznake:	Označite Brez oznak, prvi označite!