American Psychological Association 6th edition

Quinn, M. J., & Deo, N. (1986). An upper bound for the speedup of parallel best-bound branch-and-bound algorithms. BIT Numerical Mathematics, 26(1), 35-43. https://doi.org/10.1007/bf01939360

ISO-690 (author-date, English)

QUINN, Michael J. and DEO, Narsingh, 1986. An upper bound for the speedup of parallel best-bound branch-and-bound algorithms. BIT Numerical Mathematics. 1 March 1986. Vol. 26, no. 1, p. 35-43. DOI 10.1007/bf01939360.

Modern Language Association 9th edition

Quinn, M. J., and N. Deo. “An Upper Bound for the Speedup of Parallel Best-Bound Branch-and-Bound Algorithms”. BIT Numerical Mathematics, vol. 26, no. 1, Mar. 1986, pp. 35-43, https://doi.org/10.1007/bf01939360.

Mohr Siebeck - Recht (Deutsch - Österreich)

Quinn, Michael J./Deo, Narsingh: An upper bound for the speedup of parallel best-bound branch-and-bound algorithms, BIT Numerical Mathematics 1986, 35-43.

Emerald - Harvard

Quinn, M.J. and Deo, N. (1986), “An upper bound for the speedup of parallel best-bound branch-and-bound algorithms”, BIT Numerical Mathematics, Vol. 26 No. 1, pp. 35-43.

Warning: These citations may not always be 100% accurate.