Reddit reviews In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
We found 3 Reddit comments about In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Here are the top ones, ranked by their Reddit score.
Just about any integer programming technique can solve the TSP without exhausting every result. You just stop the algorithm when it reaches 0% optimality gap (in eleventy billion years for the tougher TSPs).
Here's a fun book: http://www.amazon.com/Pursuit-Traveling-Salesman-Mathematics-Computation/dp/0691152705
You may wish to check out In Pursuit of the Traveling Salesman. The first chapter is available here.
> travelling salesman is intractable
In Pursuit of the Traveling Salesman is pretty interesting historical and technical overview of advances here. With modern ILPs and cuts and other techniques, the notion of intractable today vs. 20 years ago is vastly different.