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...
Сохранить в:
| Главный автор: | |
|---|---|
| Соавтор: | |
| Формат: | Электронный ресурс eКнига |
| Язык: | английский |
| Опубликовано: |
Princeton :
Princeton University Press,
2012.
|
| Предметы: | |
| Online-ссылка: | An electronic book accessible through the World Wide Web; click to view |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|