Improving on best-of-many-christofides for T-tours
Year of publication: |
2020
|
---|---|
Authors: | Traub, Vera |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 6, p. 798-804
|
Subject: | Traveling salesman problem | T-join | Approximation algorithm | Integrality gap | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
The Steiner Traveling Salesman Problem with online edge blockages
Zhang, Huili, (2015)
-
Capacitated vehicle routing with nonuniform speeds
Gørtz, Inge Li, (2016)
-
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Murakami, Keisuke, (2018)
- More ...
-
An improved upper bound on the integrality ratio for the s-t-path TSP
Traub, Vera, (2019)
-
Layers and matroids for the traveling salesman's paths
Schalekamp, Frans, (2018)
- More ...