An Approximation Algorithm for the Maximum Traveling Salesman Problem.
Refael HassinShlomi RubinsteinPublished in: Inf. Process. Lett. (1998)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- hamiltonian cycle
- minimum spanning tree
- np hard
- objective function
- cost function
- traveling salesman
- approximation algorithms
- benchmark problems
- distance function
- particle swarm optimization
- dynamic programming
- search space
- optimal solution
- convex hull
- linear programming
- solution quality
- computational complexity