Article ID Journal Published Year Pages File Type
475357 Computers & Operations Research 2009 18 Pages PDF
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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
A comparative analysis of several asymmetric traveling salesman problem formulations
Authors
, , ,