Efficient special case algorithms for the n-line planar traveling salesman problem.
M. CutlerPublished in: Networks (1980)
Keyphrases
- traveling salesman problem
- special case
- optimization problems
- combinatorial optimization
- combinatorial optimization problems
- combinatorial problems
- computational complexity
- discrete optimization
- ant colony optimization algorithm
- scheduling problem
- subtour elimination
- hamiltonian cycle
- minimum spanning tree
- benchmark problems
- differential evolution
- ant colony optimization
- dynamic programming
- multi objective
- evolutionary algorithm