Ahn, S., Yoon, K., & Park, J. (2015). A best-first branch and bound algorithm for the pallet-loading problem. International journal of production research, 53(3), 835-849. https://doi.org/10.1080/00207543.2014.935824
Chicago Style (17th ed.) CitationAhn, S., K. Yoon, and J. Park. "A Best-first Branch and Bound Algorithm for the Pallet-loading Problem." International Journal of Production Research 53, no. 3 (2015): 835-849. https://doi.org/10.1080/00207543.2014.935824.
MLA (9th ed.) CitationAhn, S., et al. "A Best-first Branch and Bound Algorithm for the Pallet-loading Problem." International Journal of Production Research, vol. 53, no. 3, 2015, pp. 835-849, https://doi.org/10.1080/00207543.2014.935824.
Warning: These citations may not always be 100% accurate.