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 | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
Gutekunst, Samuel C., (2022)
-
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
Mnich, Matthias, (2018)
-
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Asadpour, Arash, (2017)
- More ...
-
Two-dimensional gantt charts and a scheduling algorithm of lawler
Goemans, Michael X., (1998)
-
Fluid approximations for revenue management under high-variance demand
Bai, Yicheng, (2023)
-
Stackelberg thresholds in network routing games or the value of altruism
Sharma, Yogeshwer, (2009)
- More ...