Cite
An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem.
MLA
Jia, Pujun, et al. “An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem.” Mathematical Problems in Engineering, Nov. 2021, pp. 1–10. EBSCOhost, https://doi.org/10.1155/2021/3584494.
APA
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, 1–10. https://doi.org/10.1155/2021/3584494
Chicago
Jia, Pujun, Hongwei Jiao, Dongwei Shi, and Jingben Yin. 2021. “An Efficient Branch-and-Bound Algorithm for Globally Solving Minimax Linear Fractional Programming Problem.” Mathematical Problems in Engineering, November, 1–10. doi:10.1155/2021/3584494.