Name
Title | ||
|---|---|---|
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP |
Abstract | ||
|---|---|---|
De Klerk et al., (2008) give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree theorem. This constraint says that the aggregate weight of all spanning trees in a solution to a TSP relaxation is at least that of a cycle graph. In this note, we show that the semidefinite constraint holds for any weighted 2-edge-connected graph and, in particular, is implied by the subtour elimination constraints. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.orl.2020.02.011 | Operations Research Letters |
Keywords | DocType | Volume |
Traveling Salesman Problem,Subtour LP,Matrix-tree theorem,SDP relaxation | Journal | 48 |
Issue | ISSN | Citations |
3 | 0167-6377 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gutekunst Samuel C. | 1 | 0 | 0.34 |
| David P. Williamson | 2 | 3564 | 413.34 |