Quantizers and the worst-case Euclidean traveling salesman problem.
Luis A. GoddynPublished in: J. Comb. Theory, Ser. B (1990)
Keyphrases
- traveling salesman problem
- worst case
- combinatorial optimization
- ant colony optimization
- upper bound
- lower bound
- optimization problems
- transportation networks
- np hard
- combinatorial optimization problems
- traveling salesman
- vehicle routing problem
- approximation algorithms
- combinatorial problems
- euclidean space
- hamiltonian cycle
- valid inequalities
- greedy algorithm
- euclidean distance
- ant colony optimization algorithm
- discrete particle swarm optimization
- crossover operator
- discrete optimization problems
- computational complexity
- objective function
- satisfy the triangle inequality
- neural network
- swarm intelligence
- linear program
- similarity search
- scheduling problem
- high dimensional
- genetic algorithm