The Traveling Salesman Problem and Its Variations

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

This volume provides information on 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; thorough computational analysis of heuristic and metaheuristic algorithms: theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms; and discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, and so on.