COMPUTERS & OPERATIONS RESEARCH, vol.36, no.3, pp.637-654, 2009 (SCI-Expanded)
In this Survey. a classification of 24 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. (C) 2007 Elsevier Ltd. All rights reserved.