A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.

Ola Svensson Jakub Tarnawski László A. Végh

Published in: J. ACM (2020)

Keyphrases

constant factor approximation algorithm
lower bound
branch and bound algorithm
branch and bound
combinatorial optimization problems
constant factor
upper bound
approximation algorithms
pairwise
metaheuristic
combinatorial optimization
genetic algorithm
search algorithm
column generation
subtour elimination