APA (7th ed.) Citation

Hu, P., Wu, Z., Yang, T., Liu, J., Xin, B., & Zhou, D. (2025). An Efficient Branch‐and‐Bound Algorithm for Globally Minimizing a Class of Generalized Linear Multiplicative Programs. Journal of Mathematics, 2025, 1. https://doi.org/10.1155/jom/4452933

Chicago Style (17th ed.) Citation

Hu, Peng, Zhiyou Wu, Tao Yang, Jia Liu, Bangying Xin, and Ding-Xuan Zhou. "An Efficient Branch‐and‐Bound Algorithm for Globally Minimizing a Class of Generalized Linear Multiplicative Programs." Journal of Mathematics 2025 (2025): 1. https://doi.org/10.1155/jom/4452933.

MLA (9th ed.) Citation

Hu, Peng, et al. "An Efficient Branch‐and‐Bound Algorithm for Globally Minimizing a Class of Generalized Linear Multiplicative Programs." Journal of Mathematics, vol. 2025, 2025, p. 1, https://doi.org/10.1155/jom/4452933.