旅行商問題是圖論中的一個問題，要求銷售員透過 n 個城市的最有效率的（即總距離最短的）哈密頓迴路。目前還沒有通用的解法，該問題是 NP-hard 問題。
Wolfram 語言命令FindShortestTour[g] 嘗試找到最短路徑，對於 哈密頓圖 
，如果它返回的列表的第一個元素等於 頂點數，則該最短路徑是一個哈密頓迴路（初始頂點在末尾重複）。
在電視劇《數字追兇》(NUMB3RS) 第二季的劇集“Rampage”（2006 年）中，角色拉里·弗萊恩哈特提到了旅行商問題。
旅行商問題
另請參閱
蟻群演算法, 中國郵遞員問題, 樹枝狀體, 哈密頓迴路, 最長路徑, 最佳化, 普拉託問題, 道路著色問題, 旅行商常數使用 探索
參考文獻
Applegate, D.; Bixby, R.; Chvatal, V.; and Cook, W. "Finding Cuts in the TSP (a Preliminary Report)." Technical Report 95-05, DIMACS. Piscataway NJ: Rutgers University, 1995.Applegate, D.; Bixby, R.; Chvatal, V.; and Cook, W. "Solving Traveling Salesman Problems." http://www.tsp.gatech.edu/.Hoffman, P. The Man Who Loved Only Numbers: The Story of Paul Erdős and the Search for Mathematical Truth. New York: Hyperion, pp. 168-169, 1998.Kruskal, J. B. "On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem." Proc. Amer. Math. Soc. 7, 48-50, 1956.Lawler, E.; Lenstra, J.; Rinnooy Kan, A.; and Shmoys, D. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: Wiley, 1985.Lin, S. "Computer Solutions of the Traveling Salesman Problem." Bell System Tech. J. 44, 2245-2269, 1965.Platzman, L. K. and Bartholdi, J. J. "Spacefilling Curves and the Planar Travelling Salesman Problem." J. Assoc. Comput. Mach. 46, 719-737, 1989.Reinelt, G. "TSPLIB--A Traveling Salesman Problem Library." ORSA J. Comput. 3, 376-384, 1991.Rosenkrantz, D. J.; Stearns, R. E.; and Lewis, P. M. "An Analysis of Several Heuristics for the Traveling Salesman Problem." SIAM J. Comput. 6, 563-581, 1977.Skiena, S. "Traveling Salesman Tours." §5.3.5 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 199-202, 1990.Skiena, S. S. "Traveling Salesman Problem." §8.5.4 in The Algorithm Design Manual. New York: Springer-Verlag, pp. 319-322, 1997.Steinhaus, H. Mathematical Snapshots, 3rd ed. New York: Dover, pp. 120-121, 1999.請引用為
Weisstein, Eric W. "旅行商問題。" 來自 Web 資源。 https://mathworld.tw/TravelingSalesmanProblem.html