Cargando…
The traveling salesman problem: a computational study
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest rou...
| Autores principales: | , , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Princeton Univ. Press
2006
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/1297249 |