APA (7th ed.) Citation

Zhou, Y., Lin, W., Hao, J., Xiao, M., & Jin, Y. (2022). An effective branch-and-bound algorithm for the maximum s-bundle problem. European journal of operational research, 297(1), 27-39. https://doi.org/10.1016/j.ejor.2021.05.001

Chicago Style (17th ed.) Citation

Zhou, Yi, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, and Yan Jin. "An Effective Branch-and-bound Algorithm for the Maximum S-bundle Problem." European Journal of Operational Research 297, no. 1 (2022): 27-39. https://doi.org/10.1016/j.ejor.2021.05.001.

MLA (9th ed.) Citation

Zhou, Yi, et al. "An Effective Branch-and-bound Algorithm for the Maximum S-bundle Problem." European Journal of Operational Research, vol. 297, no. 1, 2022, pp. 27-39, https://doi.org/10.1016/j.ejor.2021.05.001.