In Pursuit of the Traveling Salesman : : Mathematics at the Limits of Computation / / William J. Cook.
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 solution...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2011] ©2012 |
Year of Publication: | 2011 |
Edition: | Course Book |
Language: | English |
Online Access: | |
Physical Description: | 1 online resource (248 p.) :; 113 color illus. 19 halftones. 19 line illus. 2 tables. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
In pursuit of the traveling salesman : mathematics at the limits of computation / / William J. Cook.
by: Cook, William,
Published: (2012.) -
The traveling salesman problem and its variations / edited by Gregory Gutin and Abraham P. Punnen.
Published: (c2002.) -
The traveling salesman problem : a computational study / / David L. Applegate ... [et al.].
by: Applegate, David L.
Published: (c2006.) -
Gems in experimental mathematics : : AMS Special Session, Experimental Mathematics, January 5, 2009, Washington, DC / / Tewodros Amdeberhan, Luis A. Medina, Victor H. Moll, editors.
Published: ([2010]) -
Mathematics of choice : or how to count without counting / / by Ivan Niven.
by: Niven, Ivan,
Published: (1965.)