A comparative analysis of several asymmetric traveling salesman problem formulations
COMPUTERS & OPERATIONS RESEARCH, vol.36, no.3, pp.637-654, 2009 (SCI-Expanded, Scopus)
- Publication Type: Article / Review
- Volume: 36 Issue: 3
- Publication Date: 2009
- Doi Number: 10.1016/j.cor.2007.11.008
- Journal Name: COMPUTERS & OPERATIONS RESEARCH
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.637-654
- Galatasaray University Affiliated: Yes
Abstract
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.