A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem.
René van BevernViktoriia A. SluginaPublished in: CoRR (2020)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- hamiltonian cycle
- dynamic programming
- minimum spanning tree
- computational complexity
- search space
- objective function
- similarity measure
- np hard
- lin kernighan
- ant colony optimization algorithm
- combinatorial problems
- benchmark problems
- shortest path
- expectation maximization
- linear programming
- optimization problems
- simulated annealing
- multi objective
- optimal solution