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...
保存先:
| 第一著者: | |
|---|---|
| 団体著者: | |
| フォーマット: | 電子媒体 eBook |
| 言語: | 英語 |
| 出版事項: |
Princeton :
Princeton University Press,
2012.
|
| 主題: | |
| オンライン･アクセス: | An electronic book accessible through the World Wide Web; click to view |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料: In pursuit of the traveling salesman
- The traveling salesman problem a computational study /
- The traveling salesman problem and its variations
- How to guard an art gallery and other discrete mathematical adventures
- Handbook of discrete and combinatorial mathematics /
- Mathematics of choice or how to count without counting /
- Combinatorial reasoning : an introduction to the art of counting /