The Traveling Salesman Problem and Its Variations
Published on 2. May 2006
XVIII, 830 pages
978-0-306-48213-7 (ISBN)
Description
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
More details
Other editions
Additional editions
G. Gutin | A.P. Punnen
The Traveling Salesman Problem and Its Variations
Book
05/2002
1st Edition
Kluwer Academic Publishers
€320.99
Shipment within 15-20 days
Content
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.
