An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
| Year of publication: |
July-August 2017
|
|---|---|
| Authors: | Asadpour, Arash ; Goemans, Michel X. ; Mądry, Aleksander ; Gharan, Shayan Oveis ; Saberi, Amin |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 65.2017, 4, p. 1043-1061
|
| Subject: | traveling salesman problem | linear programming | maximum entropy | thin tree | Held-Karp relaxation | randomized rounding | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming | Entropie | Entropy | Algorithmus | Algorithm |
-
Gouveia, Luis, (2017)
-
Morante-González, R., (2025)
-
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Murakami, Keisuke, (2018)
- More ...
-
Matroids are immune to Braess' paradox
Fujishige, Satoru, (2017)
-
Cooperative facility location games
Goemans, Michel X., (2000)
-
Single machine scheduling with release dates
Goemans, Michel X., (1999)
- More ...