It is the prototypical example of the NP class of problems, and all of its algorithms' run times increase exponentially as the number of points grows.
It is the prototypical example of the NP class of problems, and all of its algorithms' run times increase exponentially as the number of points grows. The genetic algorithm is sometimes used to solve it. A 30-city tour would require more than 100 nontillion additions if every possibility were tested. FTP, name this classic problem of mathematics where one tries to find the shortest path for a round trip visit through each city on a map.
It is the prototypical example of the NP class of problems, and all of its algorithms' run times increase exponentially as the number of points grows.
{Travelling Salesman} Problem or {TSP} or {Messenger} Problem