Reddit reviews The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics (40))
We found 2 Reddit comments about The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics (40)). Here are the top ones, ranked by their Reddit score.
Used Book in Good Condition
what they do is that they construct various LP and MIP constraints that work fairly well on the particular instance.
they fitted their heuristics for optimal solution finding on a particular set of tsp instances, and these heuristics seem to generalize pretty well over real-life instances. (concorde discovered optimal solutions for 1000+ nodes I've had in about 30-60s).
The Traveling Salesman Problem: A Computational Study is a good book, completely covering the implementation.
Like compression techniques that work very well in their domain, similar thing is being done with concorde.
85,900 cities was in fact an electronic chip (AFAIK) where holes had to be drilled in smallest amount of time.
This one