traveling-salesman-problem

When the user wants to solve the Traveling Salesman Problem (TSP), find the shortest route visiting all cities, or optimize tour sequences. Also use when the user mentions "TSP," "shortest tour," "Hamiltonian cycle," "tour optimization," "route sequencing," "optimal visit order," "traveling salesperson," or "minimum distance tour." For vehicle routing with capacities, see vehicle-routing-problem.