An improved integrality gap for asymmetric TSP paths
Year of publication: |
August 2016
|
---|---|
Authors: | Friggstad, Zachary ; Gupta, Anupam ; Singh, Mohit |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 41.2016, 3, p. 745-757
|
Subject: | traveling salesman | linear programming | integrality gaps | thin spanning trees | Mathematische Optimierung | Mathematical programming | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory |
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
-
Budgeted prize-collecting traveling salesman and minimum spanning tree problems
Paul, Alice, (2020)
-
Probabilistic bounds on the k-traveling salesman problem and the traveling repairman problem
Blanchard, Moïse, (2024)
- More ...
-
Integrality gap of the vertex cover linear programming relaxation
Singh, Mohit, (2019)
-
Adaptive bin packing with overflow
Perez-Salazar, Sebastian, (2022)
-
Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
Brown, Adam, (2024)
- More ...