Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p

Let the costs $A(i,j)$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent exponential mean one random variables. We describe an enumerative algorithm that solves ATSP exactly in time $e^{\log^{3+o(1)}n}$.