Approximation Algorithms for the Minimum Bends Traveling Salesman Problem.
Clifford SteinDavid P. WagnerPublished in: IPCO (2001)
Keyphrases
- traveling salesman problem
- approximation algorithms
- minimum cost
- constant factor
- np hard
- vertex cover
- ant colony optimization
- combinatorial optimization
- special case
- optimization problems
- worst case
- combinatorial problems
- transportation networks
- exact algorithms
- vehicle routing problem
- spanning tree
- crossover operator
- precedence constraints
- constant factor approximation
- valid inequalities
- primal dual
- combinatorial optimization problems
- approximation ratio
- traveling salesman
- network flow
- undirected graph
- metaheuristic
- particle swarm optimization
- scheduling problem
- computational complexity
- neural network