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 | Algorithmus | Algorithm | Entropie | Entropy |
-
An LP-based 2/3-approximation algorithm for the s-t path graph traveling salesman problem
Gao, Zhihan, (2013)
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
-
Transgenetic algorithm for the travelling purchaser problem
Goldbarg, M. C., (2009)
- More ...
-
Online stochastic matching : online actions based on offline statistics
Manshadi, Vahideh H., (2012)
-
Online Stochastic Matching: Online Actions Based on Offline Statistics
Manshadi, Vahideh H., (2012)
-
Stochastic submodular maximization
Asadpour, Arash, (2008)
- More ...