A polynomial algorithm for a constrained traveling salesman problem.
J. Hyam RubinsteinDoreen A. ThomasNicholas C. WormaldPublished in: Networks (2001)
Keyphrases
- traveling salesman problem
- hamiltonian cycle
- ant colony optimization
- combinatorial optimization
- discrete particle swarm optimization
- minimum spanning tree
- cost function
- computational complexity
- ant colony optimization algorithm
- dynamic programming
- particle swarm optimization
- search space
- np hard
- convex hull
- knapsack problem
- combinatorial optimization problems
- optimal solution
- objective function
- neural network