This volume, which contains chapters written by reputable  researchers, 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, thorough computational  analysis of heuristic and metaheuristic algorithms, theoretical  analysis of approximation algorithms, including the emerging area of  domination analysis of algorithms, discussion of TSP software and  variations of TSP such as bottleneck TSP, generalized TSP, prize  collecting TSP, maximizing TSP, orienteering problem, etc.   Audience: Researchers, practitioners, and academicians in  mathematics, computer science, and operations research. Appropriate as  a reference work or as a main or supplemental textbook in graduate and  senior undergraduate courses and projects.

The Traveling Salesman Problem and Its Variations PDF

The list of books you might like