On Semidefinite Programming Relaxations of the Traveling Salesman Problem.
Etienne de KlerkDmitrii V. PasechnikRenata SotirovPublished in: SIAM J. Optim. (2008)
Keyphrases
- traveling salesman problem
- semidefinite programming
- semidefinite
- linear programming
- quadratically constrained quadratic
- interior point methods
- ant colony optimization
- optimization problems
- combinatorial optimization
- kernel matrix
- primal dual
- traveling salesman
- maximum margin
- feasible solution
- crossover operator
- np hard
- evolutionary algorithm
- lower bound
- column generation
- convex optimization
- computational complexity
- linear program
- search space