answersLogoWhite

0

The "travelling salesman problem" is the problem where you have to find the shortest route to visit each of several cities. Even if the distances between the cities are known, the solution is actuall quite complicated; a lot of different algorithms (methods) have been developed to optimize the problem under certain circumstances.

User Avatar

Wiki User

15y ago

What else can I help you with?