Cargando…

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.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Gutin, Gregory, 1957-, Punnen, Abraham P.
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
Tabla de Contenidos:
  • The Traveling salesman problem: applications, formulations, and variations / Abraham P. Punnen
  • Polyhedral theory and branch-and-cut algorithms for the symmetric TSP / Denis Naddef
  • Polyhedral theory for the asymmetric traveling salesman problem / Egon Balas, Matteo Fischetti
  • Exact methods for the asymmetric traveling salesman problem / Matteo Fischetti, Andrea Lodi, Paolo Toth
  • Approximation algorithms for geometric TSP / Sanjeev Arora
  • Exponential neighborhoods and domination analysis for the TSP / Gregory Gutin, Anders Yeo, Alexei Zverovitch
  • Probabilistic analysis of the TSP / A.M. Frieze, J.E. Yukich
  • Local search and metaheuristics / César Rego, Fred Flover
  • Experimental analysis of heuristics for the STSP / David S. Johnson, Lyle A. McGeoch
  • Experimental analysis of heuristics for the ATSP / David S. Johnson [and others]
  • Polynomially solvable cases of the TSP / Santosh N. Kabadi
  • The maximum TSP / Alexander Barvinok, Edward Kh. Gimadi, Anatoliy I. Serdyukov
  • The generalized traveling salesman and orienteering problems / Matteo Fischetti, Juan-JoséSlazar-González, Paolo Toth
  • The prize collecting Traveling salesman problem and its applications / Egon Balas
  • The bottleneck TSP / Santosh N. Kabadi, Abraham P. Punnen
  • TSP software / Andrea Lodi, Abraham P. Punnen.