The Traveling Salesman Problem and Its Variations

The Traveling Salesman Problem and Its Variations

by G. Gutin, A.P. Punnen

830 pages· 2006· ISBN 9780306482137
Join Readfeed freeFind clubs reading this bookBrowse readable books
About
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.

Discuss The Traveling Salesman Problem and Its Variations with other readers

Join or start a book club for The Traveling Salesman Problem and Its Variations on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for The Traveling Salesman Problem and Its Variations?

Sign up free on Readfeed, then browse public clubs or start your own club with The Traveling Salesman Problem and Its Variations as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss The Traveling Salesman Problem and Its Variations with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about The Traveling Salesman Problem and Its Variations with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.