Circulant TSP special cases : easily-solvable cases and improved approximations
Year of publication: |
2024
|
---|---|
Authors: | Beal, Austin ; Bouabida, Yacine ; Gutekunst, Samuel C. ; Rustad, Asta |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 55.2024, Art.-No. 107133, p. 1-7
|
Subject: | Complexity | Circulant | Traveling Salesman Problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
The asymmetric bottleneck traveling salesman problem : algorithms, complexity and empirical analysis
LaRusic, John, (2014)
-
Salii, Yaroslav, (2019)
-
Kou, Shuhan, (2024)
- More ...
-
Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
Gutekunst, Samuel C., (2020)
-
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)
- More ...