## Traveling Salesperson Problem

The traveling salesperson problem is a very popular optimisation problem that consists of visiting all nodes in a graph at most once in order to find a path with minimum cost.

### Related Links

The Traveling Salesman ProblemTraveling Salesman Problem