The "traveling salesman problem" is a classical computer science problem which involves finding the shortest path which could be taken by a hypothetical salesman to make a single visit to each location on a map (in a graph).

- Wiki
2 articles, 0 books.

Let’s consider a map of locations. A salesperson wants to visit each location exactly once. What’s the optimal route? This is a classic problem in computer science called the travelling salesman problem.