New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem.
Philipp HungerländerPublished in: Discret. Appl. Math. (2017)
Keyphrases
- traveling salesman problem
- semidefinite
- semidefinite programming
- linear programming
- combinatorial optimization
- interior point methods
- ant colony optimization
- kernel matrix
- optimization problems
- valid inequalities
- primal dual
- traveling salesman
- crossover operator
- kernel methods
- quadratically constrained quadratic
- linear program
- maximum margin
- metaheuristic
- sufficient conditions
- dynamic programming
- evolutionary algorithm
- optimal solution