Cite
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning.
MLA
Morrison, David R., et al. “Branch-and-Bound Algorithms: A Survey of Recent Advances in Searching, Branching, and Pruning.” Discrete Optimization, vol. 19, Feb. 2016, pp. 79–102. EBSCOhost, https://doi.org/10.1016/j.disopt.2016.01.005.
APA
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016). Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optimization, 19, 79–102. https://doi.org/10.1016/j.disopt.2016.01.005
Chicago
Morrison, David R., Sheldon H. Jacobson, Jason J. Sauppe, and Edward C. Sewell. 2016. “Branch-and-Bound Algorithms: A Survey of Recent Advances in Searching, Branching, and Pruning.” Discrete Optimization 19 (February): 79–102. doi:10.1016/j.disopt.2016.01.005.