The Travelling Salesman Problem and Its Variations
3.3 hrs read
Rate this book:
About This Book
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, and branch and bound, and branch and cut algorithms.
Buy This Book
Amazon
Ebook
→
Bookshop.org
Supports indie bookshops
→
Apple Books
Ebook
→
Open Library
Borrow
Free to borrow
→
As an Amazon Associate and Bookshop.org affiliate, BookOrb earns from qualifying purchases.
Write a Review
Sign in to write a review.
