{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T03:17:19Z","timestamp":1787887039614,"version":"build-2784847793"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T00:00:00Z","timestamp":1767398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12190-025-02737-0","type":"journal-article","created":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T08:38:17Z","timestamp":1767429497000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A practical acceleration optimization approach for the sum of affine fractions programming"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7415-7073","authenticated-orcid":false,"given":"Zhisong","family":"Hou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenwei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deke","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongwei","family":"Yue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,3]]},"reference":[{"key":"2737_CR1","doi-asserted-by":"crossref","unstructured":"Bas, S.A., Kocken, H.G., Ozkok, B.A.: A novel iterative method to solve a linear fractional transportation problem. Pak. J. Stat. Operation. Res 151\u2013166 (2022)","DOI":"10.18187\/pjsor.v18i1.3889"},{"key":"2737_CR2","doi-asserted-by":"crossref","unstructured":"Veeramani, C., Edalatpanah, S., Sharanya, S.: Solving the multiobjective fractional transportation problem through the neutrosophic goal programming approach. Discrete Dyn. Nat. Soc. 2021(1), 7308042 (2021)","DOI":"10.1155\/2021\/7308042"},{"issue":"2","key":"2737_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.ejor.2020.04.019","volume":"287","author":"K. Tone","year":"2020","unstructured":"Tone, K., Toloo, M., Izadikhah, M.: A modified slacks-based measure of efficiency in data envelopment analysis. Eur. J. Oper. Res. 287(2), 560\u2013571 (2020)","journal-title":"Eur J Oper Res."},{"issue":"3","key":"2737_CR4","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.ejor.2022.12.032","volume":"308","author":"M. Toloo","year":"2023","unstructured":"Toloo, M., Tone, K., Izadikhah, M.: Selecting slacks-based data envelopment analysis models. Eur. J. Oper. Res. 308(3), 1302\u20131318 (2023)","journal-title":"Eur J Oper Res."},{"issue":"3","key":"2737_CR5","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.ejor.2022.02.004","volume":"302","author":"J. Blomvall","year":"2022","unstructured":"Blomvall, J., Hagenbj\u00f6rk, J.: Reducing transaction costs for interest rate risk hedging with stochastic programming. Eur. J Oper. Res. 302(3), 1282\u20131293 (2022)","journal-title":"Eur J Oper Res."},{"issue":"3","key":"2737_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TEVC.2012.2196800","volume":"17","author":"A. Ponsich","year":"2012","unstructured":"Ponsich, A., Jaimes, A.L., Coello, C.A.C.: A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans. Evol. Computation. 17(3), 321\u2013344 (2012)","journal-title":"IEEE Trans Evol Computation"},{"issue":"2","key":"2737_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S1361-8415(01)00036-6","volume":"5","author":"M. Jenkinson","year":"2001","unstructured":"Jenkinson, M., Smith, S.: A global optimisation method for robust affine registration of brain images. Med. Image. Anal. 5(2), 143\u2013156 (2001)","journal-title":"Med Image Anal."},{"issue":"11","key":"2737_CR8","first-page":"66","volume":"1","author":"A. Bruhn","year":"2012","unstructured":"Bruhn, A., Pock, T., Tai, X.-C.: Efficient algorithms for global optimisation methods in computer vision. Dagstuhl. Rep. 1(11), 66\u201390 (2012)","journal-title":"Dagstuhl Rep"},{"issue":"3","key":"2737_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2013.03.025","volume":"231","author":"A. Billionnet","year":"2013","unstructured":"Billionnet, A.: Mathematical optimization ideas for biodiversity conservation. Eur. J. Oper. Res. 231(3), 514\u2013534 (2013)","journal-title":"Eur J Oper Res."},{"issue":"2","key":"2737_CR10","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.ejor.2022.09.007","volume":"307","author":"M. Marttunen","year":"2023","unstructured":"Marttunen, M., Haara, A., Hjerppe, T., Kurttila, M., Liesi\u00f6, J., Mustajoki, J., Saarikoski, H., Tolvanen, A.: Parallel and comparative use of three multicriteria decision support methods in an environmental portfolio problem. Eur. J. Oper. Res. 307(2), 842\u2013859 (2023)","journal-title":"Eur J Oper Res."},{"issue":"11","key":"2737_CR11","doi-asserted-by":"publisher","first-page":"15736","DOI":"10.1109\/TWC.2024.3431291","volume":"23","author":"F. Xu","year":"2024","unstructured":"Xu, F., Yao, J., Lai, W., Shen, K., Li, X., Chen, X., Luo, Z.-Q.: Blind beamforming for coverage enhancement with intelligent reflecting surface. IEEE Trans Wireless Commun. 23(11), 15736\u201315752 (2024)","journal-title":"IEEE Trans Wireless Commun"},{"issue":"1","key":"2737_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00120666","volume":"1","author":"H. Konno","year":"1991","unstructured":"Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Global Optim. 1(1), 65\u201381 (1991)","journal-title":"J Global Optim."},{"key":"2737_CR13","doi-asserted-by":"crossref","unstructured":"Nyiam, P.B., Salhi, A.: On the simplex, interior-point and objective space approaches to multiobjective linear programming. J. Algoritms. Comput. Technol. 15, 17483026211008414 (2021)","DOI":"10.1177\/17483026211008414"},{"issue":"5","key":"2737_CR14","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1002\/(SICI)1520-6750(199908)46:5<583::AID-NAV8>3.0.CO;2-5","volume":"46","author":"H. Konno","year":"1999","unstructured":"Konno, H., Yamashita, H.: Minimizing sums and products of linear fractional functions over a polytope. Nav. Res. Logist (NRL). 46(5), 583\u2013596 (1999)","journal-title":"Nav Res Logist (NRL)"},{"key":"2737_CR15","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10589-020-00216-9","volume":"77","author":"M. De Mauri","year":"2020","unstructured":"De Mauri, M., Gillis, J., Swevers, J., Pipeleers, G.: A proximal-point outer approximation algorithm. Comput. Optim. Appl. 77, 755\u2013777 (2020)","journal-title":"Comput Optim Appl"},{"key":"2737_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-020-00888-x","volume":"77","author":"P. Muts","year":"2020","unstructured":"Muts, P., Nowak, I., Hendrix, E.M.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming. J. Global. Optim. 77, 75\u201396 (2020)","journal-title":"J Global Optim."},{"key":"2737_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"J.E. Falk","year":"1994","unstructured":"Falk, J.E., Palocsay, S.W.: Image space analysis of generalized fractional programs. J. Global Optim. 4, 63\u201388 (1994)","journal-title":"J Global Optim."},{"issue":"4","key":"2737_CR18","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1080\/00036811.2018.1506105","volume":"99","author":"G. Li","year":"2020","unstructured":"Li, G., Li, S.: Optimality conditions for vector optimization problems with non-cone constraints in image space. Applicable. Anal. 99(4), 611\u2013626 (2020)","journal-title":"Applicable Anal"},{"key":"2737_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-009-0309-2","volume":"128","author":"D. Depetrini","year":"2011","unstructured":"Depetrini, D., Locatelli, M.: Approximation of linear fractional-multiplicative problems. Math Program. 128, 437\u2013443 (2011)","journal-title":"Math Program."},{"issue":"4","key":"2737_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM (JACM). 51(4), 671\u2013697 (2004)","journal-title":"J ACM (JACM)"},{"issue":"5","key":"2737_CR21","doi-asserted-by":"publisher","first-page":"1328","DOI":"10.1007\/s10878-020-00646-5","volume":"43","author":"C. Bazgan","year":"2022","unstructured":"Bazgan, C., Herzel, A., Ruzika, S., Thielen, C., Vanderpooten, D.: An approximation algorithm for a general class of parametric optimization problems. J. Comb. Optim. 43(5), 1328\u20131358 (2022)","journal-title":"J Comb Optim."},{"key":"2737_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1008314922240","volume":"18","author":"H. Konno","year":"2000","unstructured":"Konno, H., Fukaishi, K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Global. Optim. 18, 283\u2013299 (2000)","journal-title":"J Global Optim."},{"issue":"3","key":"2737_CR23","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"H. Jiao","year":"2015","unstructured":"Jiao, H., Liu, S.: A practicable branch and bound algorithm for sum of linear ratios problem. Eur. J. Oper. Res. 243(3), 723\u2013730 (2015)","journal-title":"Eur J Oper Res."},{"issue":"1","key":"2737_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-023-02368-0","volume":"201","author":"H. Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Shang, Y.: An outer space approach to tackle generalized affine fractional program problems. J. Optim. Theory Appl. 201(1), 1\u201335 (2024)","journal-title":"J Optim Theory Appl."},{"issue":"3","key":"2737_CR25","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A. Charnes","year":"1962","unstructured":"Charnes, A., Cooper W.W.: Programming with linear fractional functionals. Nav. Res. Logist Q. 9(3), 181\u2013186 (1962)","journal-title":"Nav Res Logist Q."},{"key":"2737_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013807129844","volume":"22","author":"T. Kuno","year":"2002","unstructured":"Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Global. Optim. 22, 155\u2013174 (2002)","journal-title":"J Global Optim."},{"issue":"2","key":"2737_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s40819-020-0771-3","volume":"6","author":"P. Singh","year":"2020","unstructured":"Singh, P., Agarwal, D., Bhati, D., Mohapatra, R.: A branch\u2013bound cut technique for non-linear fractional multi-objective optimization problems. Int. J. Appl. Comput. Math. 6(2), 29 (2020)","journal-title":"Int J Appl Comput Math"},{"key":"2737_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-015-0224-5","volume":"36","author":"H. Jiao","year":"2017","unstructured":"Jiao, H., Liu, S.: Range division and compression algorithm for quadratically constrained sum of quadratic ratios. Comput. Appl. Math. 36, 225\u2013247 (2017)","journal-title":"Comput Appl Math"},{"issue":"1","key":"2737_CR29","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/20M1325381","volume":"32","author":"N. Zhang","year":"2022","unstructured":"Zhang, N., Li, Q.: First-order algorithms for a class of fractional optimization problems. SIAM J. Optim. 32(1), 100\u2013129 (2022)","journal-title":"SIAM J Optim"},{"issue":"1","key":"2737_CR30","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1137\/19M1308165","volume":"31","author":"C. Kim","year":"2021","unstructured":"Kim, C., Mehrotra, S.: Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations. SIAM J. Optim. 31(1), 945\u2013971 (2021)","journal-title":"SIAM J Optim"},{"issue":"6","key":"2737_CR31","first-page":"1557","volume":"72","author":"H. Jiao","year":"2022","unstructured":"Jiao, H., Shang, Y., Chen, R.: A potential practical algorithm for minimizing the sum of affine fractional functions. Optimization. 72(6), 1557\u20131607 (2022)","journal-title":"Optimization"},{"issue":"3","key":"2737_CR32","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s11075-022-01471-z","volume":"93","author":"P. Shen","year":"2023","unstructured":"Shen, P., Wang, Y., Wu, D.: A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem. Numer. Algoritms. 93(3), 1373\u20131400 (2023)","journal-title":"Numer Algoritms"},{"key":"2737_CR33","doi-asserted-by":"crossref","unstructured":"Huang, B., Shen, P.: An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems. Chaos Solitons Fractals. 182, 114757 (2024)","DOI":"10.1016\/j.chaos.2024.114757"},{"key":"2737_CR34","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10589-024-00622-3","volume":"90","author":"H. Luo","year":"2025","unstructured":"Luo, H., Xu, Y., Wu, H., Wang, G: A new branch-and-cut algorithm for linear sum-of-ratios problem based on slo method and lo relaxation. Comput. Optim. Appl. 90, 257\u2013301 (2025)","journal-title":"Comput Optim Appl"},{"issue":"1","key":"2737_CR35","first-page":"1","volume":"44","author":"Y. Deng","year":"2025","unstructured":"Deng, Y., Shen, P.: An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs. Comput. Appl. Math. 44(1), 1\u201324 (2025)","journal-title":"Comput Appl Math"},{"key":"2737_CR36","doi-asserted-by":"crossref","unstructured":"Huang, B., Shen, P.: An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule. Comput. Optim. Appl (2025)","DOI":"10.1007\/s10589-025-00679-8"},{"issue":"1","key":"2737_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/02331934.2023.2253816","volume":"74","author":"H. Jiao","year":"2025","unstructured":"Jiao, H., Ma, J.: Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme. Optimization. 74(1), 1\u201332 (2025)","journal-title":"Optimization"},{"issue":"1","key":"2737_CR38","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1186\/s13662-025-03981-1","volume":"2025","author":"Z. Hou","year":"2025","unstructured":"Hou, Z., Zhao, Z., Bai, Y., Guo, D.: An outer space approximation approach for generalized affine multiplicative programming problems. Adv. Contin. Discrete Model. 2025(1), 122 (2025)","journal-title":"Adv Contin Discrete Model"},{"key":"2737_CR39","doi-asserted-by":"crossref","unstructured":"Ma, J., Shang, Y.: Global branch-reduction-bound algorithm to tackle the sum of the general affine ratios programming. Numer. Algoritms 1\u201322 (2025)","DOI":"10.1007\/s11075-025-02104-x"},{"key":"2737_CR40","doi-asserted-by":"crossref","unstructured":"Jiao, H., Ma, J.: An efficient algorithm and complexity result for solving the sum of general affine ratios problem. Chaos Solitons Fractals. 164, 112701 (2022)","DOI":"10.1016\/j.chaos.2022.112701"},{"issue":"6","key":"2737_CR41","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-021-01614-3","volume":"40","author":"S. Liu","year":"2021","unstructured":"Liu, S., Ge, L.: An outcome space algorithm for minimizing a class of linear ratio optimization problems. Comput. Appl. Math. 40(6), 225 (2021)","journal-title":"Comput Appl Math"},{"key":"2737_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00633-0","author":"Y. Zhang","year":"2024","unstructured":"Zhang, Y., Sahinidis, N.V.: Solving continuous and discrete nonlinear programs with baron. Comput. Optim. Appl (2024). https:\/\/doi.org\/10.1007\/s10589-024-00633-0","journal-title":"Comput Optim Appl"},{"key":"2737_CR43","unstructured":"Bolusani, S., Besan\u00e7on, M., Bestuzheva, K., Chmiela, A., Dion\u00edsio, J., Donkiewicz, T., Doornmalen, J., Eifler, L., Ghannam, M., Gleixner, A., et al.: The scip optimization suite 9.0. arXiv preprint arXiv:2402.17702 (2024)"},{"key":"2737_CR44","volume-title":"Applied Optimization","author":"E.B. Bajalinov","year":"2003","unstructured":"Bajalinov, E.B.: Linear-fractional programming theory, methods, applications and software. In: Applied Optimization, vol. 84. Springer, New York (2003)"},{"issue":"2","key":"2737_CR45","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/1037046","volume":"37","author":"F.H. Mathis","year":"1995","unstructured":"Mathis, F.H., Mathis, L.J.: A nonlinear programming algorithm for hospital management. SIAM Rev. 37(2), 230\u2013234 (1995)","journal-title":"SIAM Rev"},{"issue":"3","key":"2737_CR46","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10898-023-01358-w","volume":"89","author":"H. Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Yang, W: A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems. J. Global. Optim. 89(3), 597\u2013632 (2024)","journal-title":"J Global Optim."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02737-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02737-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02737-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:13:27Z","timestamp":1770740007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02737-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,3]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2737"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02737-0","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,3]]},"assertion":[{"value":"1 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}