Jia, P., Jiao, H., Shi, D., & Yin, J. (2021). An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem. Mathematical problems in engineering, 2021, 1-10. https://doi.org/10.1155/2021/3584494
Citácia podle Chicago (17th ed.)Jia, Pujun, Hongwei Jiao, Dongwei Shi, a Jingben Yin. "An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem." Mathematical Problems in Engineering 2021 (2021): 1-10. https://doi.org/10.1155/2021/3584494.
Citácia podľa MLA (8th ed.)Jia, Pujun, et al. "An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem." Mathematical Problems in Engineering, vol. 2021, 2021, pp. 1-10, https://doi.org/10.1155/2021/3584494.