An Improved Approximation Guarantee for Prize-Collecting TSP.
Jannis BlauthMartin NägelePublished in: STOC (2023)
Keyphrases
- prize collecting
- approximation guarantees
- traveling salesman problem
- greedy algorithm
- np hard
- approximation algorithms
- approximation ratio
- genetic algorithm
- linear programming relaxation
- travel time
- ant colony optimization
- lower bound
- search space
- integrality gap
- optimal solution
- single machine scheduling problem
- objective function
- linear program
- worst case
- integer programming
- special case
- search algorithm