The subtour elimination constraints imply the matrix-tree theorem SDP constraint for the TSP.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP
The subtour elimination constraints imply the matrix-tree theorem SDP constraint for the TSP.