Traveling Salesman Must Visit n Cities

Given the pairwise distances between n cities, a salesman must visit all n cities exactly once and return to the starting city. How should we arrange the visiting order to minimize the total travel distance? This classic optimization problem can be implemented using algorithms like nearest neighbor greedy approach or Held-Karp dynamic programming with O(n²2ⁿ) complexity.