An improved approximation guarantee for Prize-Collecting TSP.
Jannis BlauthMartin NägelePublished in: CoRR (2022)
Keyphrases
- prize collecting
- approximation guarantees
- traveling salesman problem
- greedy algorithm
- np hard
- approximation algorithms
- approximation ratio
- linear programming relaxation
- genetic algorithm
- search space
- lower bound
- ant colony optimization
- objective function
- integrality gap
- travel time
- optimization problems
- optimal solution
- knapsack problem
- neural network
- special case
- reinforcement learning
- minimum cost
- search algorithm
- combinatorial optimization
- worst case
- upper bound
- evolutionary algorithm
- cost function