An LP-based approximation algorithm for the generalized traveling salesman path problem.
Jian SunGregory Z. GutinPing LiPeihao ShiXiaoyan ZhangPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- linear programming
- traveling salesman
- optimal solution
- np hard
- k means
- dynamic programming
- optimal path
- randomly generated
- cost function
- search space
- worst case
- particle swarm optimization
- objective function
- neural network
- computational complexity
- shortest path
- parameter settings
- search algorithm
- path finding
- training data