Cargando…
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...
| Autor principal: | |
|---|---|
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton :
Princeton University Press,
2012.
|
| Colección: | Book collections on Project MUSE.
|
| Temas: | |
| Acceso en línea: | Texto completo |