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}$.

翻译：设非对称旅行商问题（ATSP）实例的成本$A(i,j)$为独立服从均值为1的指数分布随机变量。本文描述一种枚举算法，能在$e^{\log^{3+o(1)}n}$时间内精确求解ATSP。