The Traveling Salesman Problem and Its Variations

This volume, which contains chapters written by reputable researchers, provides the state of the art in 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, branch and bound,...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Gutin, G. (Editor ), Punnen, A.P (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Combinatorial Optimization ; 12
Temas:
Computer science-Mathematics.
Discrete mathematics.
Mathematical optimization.
Operations research.
Algorithms.
Discrete Mathematics in Computer Science.
Optimization.
Operations Research and Decision Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • The Traveling Salesman Problem: Applications, Formulations and Variations
  • Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP
  • Polyhedral Theory for the Asymmetric Traveling Salesman Problem
  • Exact Methods for the Asymmetric Traveling Salesman Problem
  • Approximation Algorithms for Geometric TSP
  • Exponential Neighborhoods and Domination Analysis for the TSP
  • Probabilistic Analysis of the TSP
  • Local Search and Metaheuristics
  • Experimental Analysis of Heuristics for the STSP
  • Experimental Analysis of Heuristics for the ATSP
  • Polynomially Solvable Cases of the TSP
  • The Maximum TSP
  • The Generalized Traveling Salesman and Orienteering Problems
  • The Prize Collecting Traveling Salesman Problem and its Applications
  • The Bottleneck TSP
  • TSP Software.

Ejemplares similares