Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
Published Online:1 Apr 1978https://doi.org/10.1287/opre.26.2.347
- Cited by
- 7 February 2026 | Random Structures & Algorithms, Vol. 68, No. 2
- Artificial Intelligence, Vol. 155, No. 1-2
- Operations Research Letters, Vol. 20, No. 1
- Artificial Intelligence, Vol. 81, No. 1-2
- Computational Optimization and Applications, Vol. 1, No. 2
- Optimization, Vol. 21, No. 6
- 6 July 2007 | IIE Transactions, Vol. 16, No. 1
- 1 January 1984 | Journal of the ACM, Vol. 31, No. 1
- European Journal of Operational Research, Vol. 11, No. 3
- Computing, Vol. 28, No. 3
Volume 26, Issue 2
March-April 1978
Pages 209-376
Article Information
Metrics
Information
- Published Online:April 01, 1978
© 1978 INFORMS
Cite as
J. K. Lenstra, A. H. G. Rinnooy Kan, (1978) Technical Note—On the Expected Performance of Branch-and-Bound Algorithms. Operations Research 26(2):347-349.
https://doi.org/10.1287/opre.26.2.347
