Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
Year of publication: |
2020
|
---|---|
Authors: | Gutekunst, Samuel C. ; Williamson, David P. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 3, p. 245-248
|
Subject: | Matrix-tree theorem | SDP relaxation | Subtour LP | Traveling Salesman Problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Kou, Shuhan, (2024)
-
Schalekamp, Frans, (2014)
-
Retail store density and the cost of greenhouse gas emissions
Cachon, GĂ©rard, (2014)
- More ...
-
Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
Gutekunst, Samuel C., (2022)
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
-
Circulant TSP special cases : easily-solvable cases and improved approximations
Beal, Austin, (2024)
- More ...