E-viri
Recenzirano
-
Sarin, Subhash C.; Sherali, Hanif D.; Bhootra, Ajay
Operations research letters, 2005, 2005-1-00, Letnik: 33, Številka: 1Journal Article
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.
