The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Year of publication: |
2023
|
---|---|
Authors: | Gutekunst, Samuel C. ; Williamson, David P. |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 48.2023, 1, p. 393-418
|
Subject: | algorithms | combinatorics | cutting plane/facet | integer programming | mathematics | networks/graphs | polyhedra | sets | traveling salesman | Einkommensverteilung | Income distribution | Theorie | Theory | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Mathematik | Mathematics |
-
Sun, Peter, (2014)
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
-
Sampaio, Afonso H., (2017)
- 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)
-
Circulant TSP special cases : easily-solvable cases and improved approximations
Beal, Austin, (2024)
- More ...