Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP.
Bo HouZhenzhen PangSuogang GaoWen LiuPublished in: AAIM (2022)
Keyphrases
- np hard
- ant colony optimization
- prize collecting
- improved algorithm
- dynamic programming
- worst case
- optimization algorithm
- detection algorithm
- search space
- error bounds
- convergence rate
- k means
- cost function
- traveling salesman problem
- expectation maximization
- computational efficiency
- learning algorithm
- computational complexity
- optimal solution
- objective function
- combinatorial optimization
- evolutionary algorithm
- knapsack problem