An improved upper bound on the integrality ratio for the s-t-path TSP
Year of publication: |
2019
|
---|---|
Authors: | Traub, Vera ; Vygen, Jens |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 3, p. 225-228
|
Subject: | Traveling salesman problem | Integrality ratio | Integrality gap | Path TSP | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
Schalekamp, Frans, (2014)
-
Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
Gutekunst, Samuel C., (2022)
-
Slightly improved upper bound on the integrality ratio for the s−t Path TSP
Zhong, Xianghui, (2020)
- More ...
-
Cost allocation for set covering : the happy nucleolus
Blauth, Jannis, (2024)
-
Layers and matroids for the traveling salesman's paths
Schalekamp, Frans, (2018)
-
Improving on best-of-many-christofides for T-tours
Traub, Vera, (2020)
- More ...