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.
Publisher: Springer-Verlag New York Inc.
Number of pages: 830
Weight: 1282 g
Dimensions: 235 x 155 x 42 mm
Edition: New edition
You may also be interested in...
Please sign in to write a review