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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Autor kompanije: | |
| Format: | Elektronički e-knjiga |
| Jezik: | engleski |
| Izdano: |
Princeton :
Princeton University Press,
2012.
|
| Teme: | |
| Online pristup: | An electronic book accessible through the World Wide Web; click to view |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|