Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters.
Michael Yu. KhachayKatherine NeznakhinaPublished in: Ann. Math. Artif. Intell. (2020)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- ant colony optimization algorithm
- hamiltonian cycle
- clustering algorithm
- combinatorial problems
- optimization problems
- transportation networks
- discrete particle swarm optimization
- vehicle routing problem
- approximation algorithms
- traveling salesman
- worst case
- combinatorial optimization problems
- data points
- valid inequalities
- discrete optimization problems
- euclidean distance
- neural network
- cost function
- computational complexity
- crossover operator
- dynamic programming
- similarity measure
- subtour elimination
- genetic local search