Solving TSP Problems with Integer Programming
The traveling salesman problem (TSP) is one of the NP-hard problems in combinatorial optimization. This paper focuses on finding the optimal planning path using integer programming and adding time allocation to minimize the cost. The use and accuracy of various algorithms are also compared in solving this problem.
Journal of Physics: Conference Series
Yu, Dian; Tao, Yanrong; and Ma, Yue, "Solving TSP Problems with Integer Programming" (2022). Kean Publications. 691.