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...
Saved in:
| 主要作者: | |
|---|---|
| 企業作者: | |
| 格式: | 電子 電子書 |
| 語言: | 英语 |
| 出版: |
Princeton :
Princeton University Press,
2012.
|
| 主題: | |
| 在線閱讀: | An electronic book accessible through the World Wide Web; click to view |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|