A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Szymon DudyczJan MarcinkowskiKatarzyna E. PaluchBartosz RybickiPublished in: CoRR (2015)
Keyphrases
- traveling salesman problem
- ant colony optimization
- discrete particle swarm optimization
- objective function
- combinatorial optimization
- hamiltonian cycle
- dynamic programming
- simulated annealing
- minimum spanning tree
- computational complexity
- undirected graph
- knapsack problem
- linear programming
- optimization problems
- cost function
- expectation maximization
- vehicle routing problem
- approximation algorithms
- combinatorial optimization problems
- np hard
- genetic local search