Posted March 13Mar 13 The Traveling Salesman Problem and Its Variations The Traveling Salesman Problem and Its Variations by G. Gutin, A.P. Punnen Publisher Springer Science & Business Media Published Date 2006-05-02 Page Count 830 Categories Computers / Data Science / General, Mathematics / Applied, Business & Economics / Operations Research, Computers / Programming / Algorithms, Mathematics / Discrete Mathematics, Computers / Information Technology, Mathematics / Optimization, Mathematics / Numerical Analysis Language EN Average Rating N/A (based on N/A ratings) Maturity Rating No Mature Content Detected ISBN 0306482134 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 Information
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.