Skip to main content
Computer Science

Return to Question

edited tags
Link
Raphael
Raphael
  • 73.4k
  • 31
  • 184
  • 406

Traveling salesman problem - Calculating How can you bound the error of an approximation without knowing the optimal toursolution?

Tweeted twitter.com/#!/StackCompSci/status/387915605606944768
Source Link
Ilya Gazman
Ilya Gazman
  • 919
  • 3
  • 15
  • 33

Traveling salesman problem - Calculating the optimal tour

I been looking at this site and it says that people found solutions for TSP tours that are just 0.031% higher than the optimal tour is. Without finding the optimal tour how does they know what length it is supposed to be?