Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
Published Online:1 Feb 1973https://doi.org/10.1287/opre.21.1.340
- Cited by
- EURO Journal on Transportation and Logistics, Vol. 1, No. 1-2
- Discrete Applied Mathematics, Vol. 155, No. 16
- European Journal of Operational Research, Vol. 119, No. 2
- European Journal of Operational Research, Vol. 59, No. 2
- 30 March 2007 | International Journal of Production Research, Vol. 28, No. 12
- 22 August 2014
- International Journal of Parallel Programming, Vol. 17, No. 3
- Operations Research Letters, Vol. 7, No. 2
- 29 March 2011 | RAIRO - Operations Research, Vol. 18, No. 3
- 1 January 1984 | Journal of the ACM, Vol. 31, No. 1
- 10 October 2006 | Naval Research Logistics Quarterly, Vol. 30, No. 1
- 9 July 2007 | A I I E Transactions, Vol. 10, No. 4
Volume 21, Issue 1
January-February 1973
Pages 1-400
Article Information
Metrics
Information
- Published Online:February 01, 1973
© 1973 INFORMS
Cite as
Robert S. Garfinkel, (1973) Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem. Operations Research 21(1):340-343.
https://doi.org/10.1287/opre.21.1.340
