)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Arash AsadpourMichel X. GoemansAleksander MadryShayan Oveis GharanAmin SaberiPublished in: Oper. Res. (2017)
Keyphrases
- experimental evaluation
- learning algorithm
- dynamic programming
- np hard
- optimization algorithm
- improved algorithm
- optimal solution
- times faster
- detection algorithm
- segmentation algorithm
- theoretical analysis
- input data
- probabilistic model
- branch and bound algorithm
- monte carlo
- high accuracy
- data sets
- cost function
- computational complexity
- search algorithm
- neural network
- computationally efficient
- computational cost
- search space
- preprocessing
- tree structure
- closed form
- error bounds
- objective function