Travelling Saleman Problem

  1. I change the question completely. If i get an answer for this, my question would be resolved.

    Everyone is obsessive of finding minimum distance in Travelling Salesman Problem, but my question is,

    "Is there a way to find the maximum distance possible?"

    I know it is related to theory of computation, but i don't want to get into complication of computers.
  2. jcsd
  3. Hi, I dont know much about the TSP, but wonder in what way the problem of finding the maximum distance differs from that of finding the minimum.
  4. I don't think it changes it at all. It's the same exact thing. Just invert the weights.
Know someone interested in this topic? Share this thead via email, Google+, Twitter, or Facebook

Have something to add?
Similar discussions for: Travelling Saleman Problem