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...
Збережено в:
| Автор: | |
|---|---|
| Співавтор: | |
| Формат: | Електронний ресурс eКнига |
| Мова: | Англійська |
| Опубліковано: |
Princeton :
Princeton University Press,
2012.
|
| Предмети: | |
| Онлайн доступ: | An electronic book accessible through the World Wide Web; click to view |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|