The Traveling Salesman Problem : A Computational Study

Mostrar otras versiones (2)

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...

Descripción completa

Detalles Bibliográficos
Autor principal: Applegate, David L.
Otros Autores: Cook, William J., Chvatal, Vasek, Bixby, Robert E.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Princeton : Princeton University Press, 2011.
Colección:Book collections on Project MUSE.
Temas:
Traveling salesman problem.
MATHEMATICS > Applied.
MATHEMATICS > Graphic Methods.
Problemes de tournees.
Electronic books.
Acceso en línea:Texto completo

MARC

LEADER 00000cam a22000004a 4500
001 musev2_30452
003 MdBmJHUP
005 20230905043223.0
006 m o d
007 cr||||||||nn|n
008 110905s2011 nju o 00 0 eng d
020 |a 9781400841103 
020 |z 9780691129938 
040 |a MdBmJHUP  |c MdBmJHUP 
100 1 |a Applegate, David L. 
245 1 4 |a The Traveling Salesman Problem :   |b A Computational Study 
264 1 |a Princeton :  |b Princeton University Press,  |c 2011. 
264 3 |a Baltimore, Md. :  |b Project MUSE,   |c 0000 
264 4 |c ©2011. 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 0 |a Princeton Series in Applied Mathematics 
505 0 0 |t Frontmatter --  |t Contents --  |t Preface --  |t Chapter 1. The Problem --  |t Chapter 2. Applications --  |t Chapter 3. Dantzig, Fulkerson, and Johnson --  |t Chapter 4. History of TSP Computation --  |t Chapter 5. LP Bounds and Cutting Planes --  |t Chapter 6. Subtour Cuts and PQ-Trees --  |t Chapter 7. Cuts from Blossoms and Blocks --  |t Chapter 8. Combs from Consecutive Ones --  |t Chapter 9. Combs from Dominoes --  |t Chapter 10. Cut Metamorphoses --  |t Chapter 11. Local Cuts --  |t Chapter 12. Managing the Linear Programming Problems --  |t Chapter 13. The Linear Programming Solver Chapter 14. Branching --  |t Chapter 14. Branching --  |t Chapter 15. Tour Finding --  |t Chapter 16. Computation --  |t Chapter 17. The Road Goes On --  |t Bibliography --  |t Index. 
520 |a 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. 
546 |a In English. 
588 |a Description based on print version record. 
650 7 |a Traveling salesman problem.  |2 fast  |0 (OCoLC)fst01155795 
650 7 |a MATHEMATICS  |x Applied.  |2 bisacsh 
650 7 |a MATHEMATICS  |x Graphic Methods.  |2 bisacsh 
650 6 |a Problemes de tournees. 
650 0 |a Traveling salesman problem. 
655 7 |a Electronic books.   |2 local 
700 1 |a Cook, William J. 
700 1 |a Chvatal, Vasek. 
700 1 |a Bixby, Robert E. 
710 2 |a Project Muse.  |e distributor 
830 0 |a Book collections on Project MUSE. 
856 4 0 |z Texto completo  |u https://projectmuse.uam.elogim.com/book/30452/ 
945 |a Project MUSE - Custom Collection 

Ejemplares similares