An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices.
David BlokhEugene LevnerPublished in: Discret. Appl. Math. (2002)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- hamiltonian cycle
- minimum spanning tree
- dynamic programming
- objective function
- linear programming
- ant colony optimization algorithm
- particle swarm optimization
- traveling salesman
- cost function
- graph cuts
- constraint satisfaction
- expectation maximization
- np hard
- weighted graph
- primal dual
- search space
- optimal solution
- similarity measure