Dansk
Traveling Salesman Problem and Its Variations e-bog
2921,57 DKK
(inkl. moms 3651,96 DKK)
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...
E-bog
2921,57 DKK
Forlag
Springer
Udgivet
2 maj 2006
Genrer
Management decision making
Sprog
English
Format
pdf
Beskyttelse
LCP
ISBN
9780306482137
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.