The Traveling Salesman Problem and Its Variations

G. Gutin, A.P. Punnen
Springer Science & Business Media, 31.05.2002 - 830 Seiten

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.

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.

Andere Ausgaben - Alle anzeigen

Verweise auf dieses Buch

Graphs, Networks and Algorithms
Dieter Jungnickel
Eingeschränkte Leseprobe - 2007
Alle Ergebnisse von Google Books »

Bibliografische Informationen