2-matchings, the traveling salesman problem, and the subtour LP : a proof of the Boyd-Carr conjecture
Year of publication: |
2014
|
---|---|
Authors: | Schalekamp, Frans ; Williamson, David P. ; Zuylen, Anke van |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 39.2014, 2, p. 403-417
|
Subject: | traveling salesman problem | subtour elimination | linear programming | integrality gap | 2-matching | fractional 2-matching | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
Gutekunst, Samuel C., (2022)
-
An improved upper bound on the integrality ratio for the s-t-path TSP
Traub, Vera, (2019)
-
Improving on best-of-many-christofides for T-tours
Traub, Vera, (2020)
- More ...
-
Clustering with or without the approximation
Schalekamp, Frans, (2013)
-
Deterministic pivoting algorithms for constrained ranking and clustering problems
Zuylen, Anke van, (2009)
-
An improved monotone algorithm for scheduling related machines with precedence constraints
Zuylen, Anke van, (2011)
- More ...