| Article ID: | iaor2005761 |
| Country: | Netherlands |
| Volume: | 33 |
| Issue: | 1 |
| Start Page Number: | 62 |
| End Page Number: | 70 |
| Publication Date: | Jan 2005 |
| Journal: | Operations Research Letters |
| Authors: | Sarin Subhash C., Sherali Hanif D., Bhootra Ajay |
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 relaxed Dantzig–Fulkerson–Johnson subtour constraints. Promising computational results are presented, particularly in the presence of precedence constraints.