Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP.

Samuel C. Gutekunst David P. Williamson

Published in: CoRR (2019)

Keyphrases

subtour elimination
traveling salesman problem
lp relaxation
ant colony optimization
global constraints
combinatorial optimization
semi definite programming
linear constraints
lower bound
low rank
semidefinite programming
traveling salesman