A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time.
James K. ParkPublished in: Inf. Process. Lett. (1991)
Keyphrases
- traveling salesman problem
- special case
- hamiltonian cycle
- ant colony optimization
- combinatorial optimization
- optimization problems
- transportation networks
- discrete particle swarm optimization
- ant colony optimization algorithm
- computational complexity
- traveling salesman
- combinatorial problems
- genetic local search
- np hard
- valid inequalities
- discrete optimization problems
- combinatorial optimization problems
- approximation algorithms
- vehicle routing problem
- metaheuristic
- particle swarm optimization
- linear programming
- nearest neighbor
- scheduling problem