Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is a classic problem in combinatorial optimization and operations research that involves finding the shortest possible tour that visits each city exactly once and returns to the starting city.