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...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Princeton :
Princeton University Press,
2012.
|
| Subjects: | |
| Online Access: | An electronic book accessible through the World Wide Web; click to view |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|