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

Full description

Bibliographic Details

Main Author:	Cook, William, 1957-
Corporate Author:	ebrary, Inc
Format:	eBook
Language:	English
Published:	Princeton : Princeton University Press, 2012.
Subjects:	Traveling salesman problem. Computational complexity. Electronic books.
Online Access:	Connect to the full text of this electronic book