A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Szymon DudyczJan MarcinkowskiKatarzyna E. PaluchBartosz RybickiPublished in: IPCO (2017)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- dynamic programming
- discrete particle swarm optimization
- hamiltonian cycle
- minimum spanning tree
- cost function
- simulated annealing
- optimization problems
- expectation maximization
- np hard
- combinatorial problems
- ant colony optimization algorithm
- computational complexity
- objective function
- linear programming
- np complete
- distance metric
- convex hull
- search space
- traveling salesman