Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension.
Vladimir ShenmaierPublished in: Optim. Lett. (2022)
Keyphrases
- traveling salesman problem
- metric space
- similarity search
- combinatorial optimization
- ant colony optimization
- optimization problems
- euclidean space
- hamiltonian cycle
- distance function
- vector space
- traveling salesman
- access methods
- similarity queries
- similarity searching
- subtour elimination
- genetic algorithm
- aco algorithm
- approximation algorithms
- high dimensional