Description
This authoritative text by Vera Traub and Jens Vygen provides an in-depth exploration of approximation algorithms for the traveling salesman problem, one of the most studied problems in combinatorial optimization. The book covers the fundamental theory and practical applications of TSP algorithms, from classical greedy and local search methods to cutting-edge approximation techniques.
Published by Cambridge University Press, this comprehensive resource is designed for researchers, graduate students, and practitioners in computer science and operations research. The authors present rigorous mathematical foundations alongside accessible explanations of complex algorithmic concepts. Topics include linear programming relaxations, branch-and-bound methods, and recent breakthroughs in approximation ratios.
Whether you’re approaching TSP for the first time or seeking advanced knowledge of state-of-the-art algorithms, this book serves as both a learning resource and a reference guide for understanding how to efficiently solve large-scale traveling salesman problems in practice.
Reviews
There are no reviews yet.