An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem.
Kyle GenovaDavid P. WilliamsonPublished in: CoRR (2015)
Keyphrases
- experimental evaluation
- traveling salesman problem
- combinatorial optimization
- hamiltonian cycle
- ant colony optimization
- cost function
- dynamic programming
- simulated annealing
- objective function
- minimum spanning tree
- computational complexity
- convex hull
- discrete particle swarm optimization
- np hard
- multi objective
- global optimization
- optimal solution
- ant colony optimization algorithm
- similarity measure