| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524027 | Operations Research Letters | 2005 | 9 Pages |
Abstract
We propose a new formulation for the asymmetric traveling salesman problem, with and without precedence relationships, which employs a polynomial number of subtour elimination constraints that imply an exponential subset of certain relaxed Dantzig-Fulkerson-Johnson subtour constraints. Promising computational results are presented, particularly in the presence of precedence constraints.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Subhash C. Sarin, Hanif D. Sherali, Ajay Bhootra,