= Steiner travelling salesman problem
{wiki=Steiner_travelling_salesman_problem}
The Steiner Traveling Salesman Problem (STSP) is a variant of the classic Traveling Salesman Problem (TSP), which is a well-known problem in combinatorial optimization. In the traditional TSP, the goal is to find the shortest possible route that visits a set of given cities and returns to the original city. The challenge is to minimize the total distance traveled. The Steiner Traveling Salesman Problem extends this concept by allowing the introduction of additional points, known as Steiner points, into the route.
Back to article page