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...
| Autor principal: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Princeton :
Princeton University Press
2011.
|
| Colección: | EBSCO Academic eBook Collection Complete.
|
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b31121147*spi |
| Sumario: | 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 route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The autho. |
|---|---|
| Descripción Física: | 606 p. |
| Formato: | Forma de acceso: World Wide Web. |
| ISBN: | 9781400841103 9780691129938 9781283256117 |
