New answers tagged traveling-salesman
0
votes
Reducing euclidean TSP of smaller size to euclidean TSP of bigger size
Here's an idea that doesn't work: Assume K = N-1. Take any node X and create another node X' at a distance epsilon from X, and calculate all the distances to X', then solve the N problem. If that ...
- 28.4k
Top 50 recent answers are included