|
|
|
|
|
|
by gus_massa
2736 days ago
|
|
|
You can always find a solution to the TSP. All cities are connected with all cities, so you can travel the cities in the alphabetical order (or the order in list). It's (usually) a very bad solution that is much longer than the best solution. There are good heuristic, specially if the distances are not chosen at random but are the distance between points in the plane. So it's posible in some cases to find quite good solutions. The problem is NP-complete only is you ask for the best solution. |
|
|