Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension.
Vladimir ShenmaierPublished in: CoRR (2020)
Keyphrases
- traveling salesman problem
- metric space
- combinatorial optimization
- ant colony optimization
- similarity search
- euclidean space
- distance function
- similarity searching
- optimization problems
- traveling salesman
- hamiltonian cycle
- range queries
- approximation algorithms
- multi objective
- high dimensional
- vector space
- access methods
- dimensional vector
- satisfy the triangle inequality
- data sets
- metaheuristic
- data model
- query processing
- evolutionary algorithm
- genetic algorithm