The traveling salesman problem and its variations /
This volume provides information on theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, and branch and bound, and branch and cut algorithms.
Clasificación: | Libro Electrónico |
---|---|
Otros Autores: | , |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Dordrecht ; Boston :
Kluwer Academic Publishers,
©2002.
|
Colección: | Combinatorial optimization ;
v. 12. |
Temas: | |
Acceso en línea: | Texto completo |
Sumario: | This volume provides information on theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, and branch and bound, and branch and cut algorithms. |
---|---|
Descripción Física: | 1 online resource (xviii, 830 pages) : illustrations. |
Bibliografía: | Includes bibliographical references (pages 761-806) and index. |
ISBN: | 0306482134 9780306482137 1402006640 9781402006647 |