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

Szczegółowa specyfikacja

Opis bibliograficzny

1. autor:	Cook, William, 1957-
Korporacja:	ebrary, Inc
Format:	Elektroniczne E-book
Język:	angielski
Wydane:	Princeton : Princeton University Press, 2012.
Hasła przedmiotowe:	Traveling salesman problem. Computational complexity. Electronic books.
Dostęp online:	An electronic book accessible through the World Wide Web; click to view
Etykiety:	Dodaj etykietę Nie ma etykietki, Dołącz pierwszą etykiete!