Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP.

Samuel C. Gutekunst David P. Williamson

Published in: Oper. Res. Lett. (2020)

Keyphrases

subtour elimination
traveling salesman problem
lp relaxation
optimization problems
linear programming
combinatorial optimization
global constraints
linear constraints
ant colony optimization
soft constraints
traveling salesman
semidefinite programming