In this survey, a classification of twenty-seven Asymmetric Traveling Salesman Problem (ATSP) formulations is presented. The strength of their LP relaxations is discussed and known relationships from the literature are reviewed. Some new relationships are also introduced, and computational results are reported.