Do you mean the "Traveling Salesman Problem"?
This is an example of an NP-complete problem.
Thus algorithms are inefficient.
Here are two.
Dijkstra's Algorithm.
Floyd-Warshall Algorithm
What is the best algorithm for solving a general TPS problem these days? I've heard they've solved the problem with finding the shortest path through all villages in Sweden or something like that. Anyone who knows if that is possible with today's techniques?
Do you mean the "Traveling Salesman Problem"?
This is an example of an NP-complete problem.
Thus algorithms are inefficient.
Here are two.
Dijkstra's Algorithm.
Floyd-Warshall Algorithm