Traveling Salesman Problem
摘要
The traveling salesman problem (TSP) is perhaps the most studied discrete optimization problem. Its popularity is due to the fact that TSP is easy to formulate and difficult to solve and has a large number of applications.