Conference ProceedingsOPEN ACCESS

Solving TSP Problems with Integer Programming

Journal of Physics: Conference Series (2022) 2381(1)
DOI: 10.1088/1742-6596/2381/1/012045
2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Yu, D., Tao, Y., & Ma, Y. (2022). Solving TSP Problems with Integer Programming. In Journal of Physics: Conference Series (Vol. 2381). Institute of Physics. https://doi.org/10.1088/1742-6596/2381/1/012045

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free