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...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Searvvušdahkki: | |
| Materiálatiipa: | Elektrovnnalaš E-girji |
| Giella: | eaŋgalasgiella |
| Almmustuhtton: |
Princeton :
Princeton University Press,
2012.
|
| Fáttát: | |
| Liŋkkat: | An electronic book accessible through the World Wide Web; click to view |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Geahča maid: 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 /