The Traveling Salesman Problem
摘要
The traveling salesman problem (TSP) is a classical algorithmic problem. It consists of identifying the shortest possible route between connected cities and returning to the origin city. For a given set of cities, this problem is solved by identifying the shortest path; each city should be visited exactly once.