A Better-Than-1.6-Approximation for Prize-Collecting TSP.
Jannis BlauthNathan KleinMartin NägelePublished in: CoRR (2023)
Keyphrases
- prize collecting
- traveling salesman problem
- genetic algorithm
- approximation error
- ant colony optimization
- travel time
- search space
- combinatorial optimization
- np hard
- three dimensional
- error bounds
- approximation algorithms
- travelling salesman
- neural network
- search algorithm
- particle swarm optimization pso
- computer vision