New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
Year of publication: |
2005
|
---|---|
Authors: | Sarin, Subhash C. ; Sherali, Hanif D. ; Bhootra, Ajay |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 33.2005, 1, p. 62-70
|
Saved in:
Saved in favorites
Similar items by person
-
Minimizing conditional-value-at-risk for stochastic scheduling problems
Sarin, Subhash Chander, (2014)
-
Sarin, Subhash Chander, (2014)
-
Aguayo, Maichel M., (2018)
- More ...