Does there exist an instance of the travelling salesman problem where the optimal solution has edges that cross?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
0
|
||||||||||||||||||||
|
|
0
|
Yes, as long as your distance does not satisfy the triangle inequality. Here is a series of points which form a shortest route under the Hamming distance. If you plot them on the plane, you will notice that they cross over. (1,1) (1,2) (4,2) (3,2) (0,2) (0,1) |
|||||
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
6
|
I've answered this in http://stackoverflow.com/questions/2444125/crossing-edges-in-the-travelling-salesman-problem/2444288#2444288. |
||
|
|

