 Travelling salesman problem

Given finitely many locations and pairwise travel costs, find a cyclic visiting order minimizing the sum of its costs. For Euclidean distance this becomes the Euclidean travelling salesman tour problem.

The Traveling Salesman Problem (TSP) is a classic optimization problem in combinatorial optimization and operations research. It can be described as follows: A salesman needs to visit a set of cities exactly once and then return to the original city. The objective is to find the shortest possible route that allows the salesman to visit each city once and return to the starting point. The problem is typically represented as a graph, where cities are nodes and edges represent the distances (or costs) between them.