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!
|
Table of Contents:
- Frontmatter
- Contents
- Preface
- 1: Challenges
- 2: Origins of the Problem
- 3: The Salesman in Action
- 4: Searching for a Tour
- 5: Linear Programming
- 6: Cutting Planes
- 7: Branching
- 8: Big Computing
- 9: Complexity
- 10: The Human Touch
- 11: Aesthetics
- 12: Pushing the Limits
- Notes
- Bibliography
- Index