Efficient algorithm for globally computing the min–max linear fractional programming problem
RAIRO-Oper. Res., 57 3 (2023) 1523-1537
Published online: 2023-06-21
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Optimizing the minimax affine fractional problem in reduced space
Binbin Li and Yuelin GaoJournal of Applied Mathematics and Computing (2025)
https://doi.org/10.1007/s12190-025-02427-x
An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
Bingdi Huang and Peiping ShenComputational Optimization and Applications 91 (3) 1339 (2025)
https://doi.org/10.1007/s10589-025-00679-8
Global algorithm for effectively solving min-max affine fractional programs
Hongwei Jiao, Yudong Sun, Wenjie Wang and Youlin ShangJournal of Applied Mathematics and Computing 70 (2) 1787 (2024)
https://doi.org/10.1007/s12190-024-02027-1
A Novel Affine Relaxation-Based Algorithm for Minimax Affine Fractional Program
Hongwei Jiao, Binbin Li and Youlin ShangAsia-Pacific Journal of Operational Research 41 (05) (2024)
https://doi.org/10.1142/S0217595923500367