{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T18:31:37Z","timestamp":1761849097439,"version":"build-2065373602"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"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":[[2025,12]]},"DOI":"10.1007\/s12190-025-02626-6","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T15:44:46Z","timestamp":1760456686000},"page":"8019-8044","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A spatial branching and cutting algorithm for minimizing the sum of affine fractional functions"],"prefix":"10.1007","volume":"71","author":[{"given":"Yaping","family":"Deng","sequence":"first","affiliation":[]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,14]]},"reference":[{"key":"2626_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S. Schaible","year":"2003","unstructured":"Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optim Methods Softw 18, 219\u2013229 (2003)","journal-title":"Optim Methods Softw"},{"key":"2626_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10589-012-9488-5","volume":"54","author":"T. Kuno","year":"2013","unstructured":"Kuno, T., Masaki, T.: A practical but rigorous approach to sum-of-ratios optimization in geometric applications. Comput. Optim. Appl. 54, 93\u2013109 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2626_CR3","first-page":"295","volume":"39","author":"H. Konno","year":"1996","unstructured":"Konno, H., Watanabe, H.: Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach. J. Oper. Res. Soc. Jpn-Keiei Kagaku. 39(3), 295\u2013306 (1996)","journal-title":"J. Oper. Res. Soc. Jpn-Keiei Kagaku."},{"key":"2626_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10878-005-5485-2","volume":"9","author":"D.Z. Chen","year":"2005","unstructured":"Chen, D.Z., Daescu, O., Dai, Y., Katoh, N., Wu, X.D., Xu, J.H.: Optimizing the sum of linear fractional functions and applications. J. Comb. Optim. 9, 69\u201390 (2005)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"2626_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11263-007-0117-1","volume":"79","author":"F. Kahl","year":"2008","unstructured":"Kahl, F., Agarwal, S., Chandraker, M.K., Kriegman, D., Belongie, S.: Practical global optimization for multiview geometry. Int. J. Comput. Vis. 79(3), 271\u2013284 (2008)","journal-title":"Int. J. Comput. Vis."},{"key":"2626_CR6","doi-asserted-by":"publisher","first-page":"14784","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"H. Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shang, Y.L.: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems. J. Comput. Appl. Math. 419, 14784 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"11","key":"2626_CR7","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1080\/02331934.2019.1632250","volume":"68","author":"I. Stancu-Minasian","year":"2019","unstructured":"Stancu-Minasian, I.: A ninth bibliography of fractional programming. Optimization. 68(11), 2125\u20132169 (2019)","journal-title":"Optimization."},{"issue":"3\u20134","key":"2626_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0925-7721(99)00003-6","volume":"12","author":"J. Majhi","year":"1999","unstructured":"Majhi, J., Janardan, R., Schwerdt, J., Smid, M., Gupta, P.: Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comp. Geom. Theor. Appl. 12(3\u20134), 241\u2013267 (1999)","journal-title":"Comp. Geom. Theor. Appl."},{"key":"2626_CR9","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1002\/nav.3800240416","volume":"24","author":"S. Schaible","year":"1977","unstructured":"Schaible, S.: A note on the sum of a linear and linear-fractional function. Nav. Res. Logist. Q. 24, 691\u2013693 (1977)","journal-title":"Nav. Res. Logist. Q."},{"key":"2626_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T. Matsui","year":"1996","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Global Optim. 9, 113\u2013119 (1996)","journal-title":"J. Global Optim."},{"key":"2626_CR11","doi-asserted-by":"publisher","first-page":"106234.1","DOI":"10.1016\/j.cie.2019.106234","volume":"140","author":"B.A. Ozkok","year":"2020","unstructured":"Ozkok, B.A.: An iterative algorithm to solve a linear fractional programming problem, comput. Ind. Eng. 140, .106234.1\u2013.106234.7 (2020)","journal-title":"Ind. Eng."},{"key":"2626_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 problem. J. Glob. Optim. 1, 65\u201381 (1991)","journal-title":"J. Glob. Optim."},{"key":"2626_CR13","first-page":"65","volume":"10","author":"A. Cambini","year":"1989","unstructured":"Cambini, A., Martein, L., Schaible, S.: On maximizing a sum of ratios. J. Inf. Optim. Sci. 10, 65\u201379 (1989)","journal-title":"J. Inf. Optim. Sci."},{"key":"2626_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. 46, 583\u2013596 (1999)","journal-title":"Nav. Res. Logist."},{"issue":"3","key":"2626_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"N.T.H. Phuong","year":"2003","unstructured":"Phuong, N.T.H., Tuy: H.: a unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26(3), 229\u2013259 (2003)","journal-title":"J. Glob. Optim."},{"key":"2626_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01585557","volume":"69","author":"Y.E. Nesterov","year":"1995","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: An interior-point method for generalized linear-fractional programming. Math. Program. 69, 177\u2013204 (1995)","journal-title":"Math. Program."},{"key":"2626_CR17","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 algorithm for linear fractional multiplicative problems. Math. Program. 128, 437\u2013443 (2011)","journal-title":"Math. Program."},{"key":"2626_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1186\/s13660-018-1651-9","volume":"2018","author":"P.P. Shen","year":"2018","unstructured":"Shen, P.P., Lu, T.: Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J. Inequal. Appl. 2018, 63 (2018)","journal-title":"J. Inequal. Appl."},{"key":"2626_CR19","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"P.P. Shen","year":"2019","unstructured":"Shen, P.P., Huang, B.D., Wang, L.F.: Range division and linearization algorithm for a class of linear ratios optimization problems. J. Comput. Appl. Math. 350, 324\u2013342 (2019)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2626_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-Convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"2626_CR21","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/ijoc.2021.1097","volume":"34","author":"V. Mahmoodian","year":"2022","unstructured":"Mahmoodian, V., Dayarian, I., Saghand, P.G., Zhang, Y., Charkhgard: H.: A criterion space branch-and-cut algorithm for mixed integer bilinear maximum multiplicative programs. INFORMS J Comput 34, 1453\u20131470 (2022)","journal-title":"INFORMS J Comput"},{"issue":"3","key":"2626_CR22","doi-asserted-by":"publisher","first-page":"784","DOI":"10.4208\/jcm.2210-m2021-0067","volume":"42","author":"B. Zhang","year":"2024","unstructured":"Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: A new global optimization algorithm foe mixed-integer quadratically constrained quadratic fractional programming problem. J Comput Math 42(3), 784\u2013813 (2024)","journal-title":"J Comput Math"},{"key":"2626_CR23","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. Glob. Optim. 22, 155\u2013174 (2002)","journal-title":"J. Glob. Optim."},{"key":"2626_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10898-004-1952-z","volume":"33","author":"T. Kuno","year":"2005","unstructured":"Kuno, T.: A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-rations problems. J. Glob. Optim. 33, 215\u2013234 (2005)","journal-title":"J. Glob. Optim."},{"key":"2626_CR25","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"H. Benson","year":"2007","unstructured":"Benson, H.: A simplicial branch and bound duality bounds algorithm for the linear sum of ratios problem. Eur J Oper Res 182, 597\u2013611 (2007)","journal-title":"Eur J Oper Res"},{"key":"2626_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","volume":"146","author":"H. Benson","year":"2010","unstructured":"Benson, H.: Branch and bound outer approximation algorithm for sum-of-ratios fractional programs. J Optim Theory Appl 146, 1\u201318 (2010)","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"2626_CR27","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"H.W. Jiao","year":"2015","unstructured":"Jiao, H.W., Liu: S.Y.: 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."},{"key":"2626_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-021-01614-3","volume":"40","author":"S.Y. Liu","year":"2021","unstructured":"Liu, S.Y., Ge, L.: An outcome space algorithm for minimizing a class of linear ratio optimization problems. Comput. Appl. Math. 40, 225 (2021)","journal-title":"Comput. Appl. Math."},{"issue":"6","key":"2626_CR29","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1080\/02331934.2022.2027940","volume":"72","author":"B. Zhang","year":"2022","unstructured":"Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: A new deterministic global computing algorithm for solving a kind of linear fractional programming. Optimization. 72(6), 1485\u20131513 (2022)","journal-title":"Optimization."},{"issue":"3\u20134","key":"2626_CR30","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\u20134), 181\u2013186 (1962)","journal-title":"Nav. Res. Logist. Q."},{"issue":"6","key":"2626_CR31","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1080\/02331934.2022.2032051","volume":"72","author":"H.W. Jiao","year":"2023","unstructured":"Jiao, H.W., Shang, Y.L., Chen: R.J.: a potential practical algorithm for minimizing the sum of affine fractional functions. Optimization. 72(6), 1577\u20131607 (2023)","journal-title":"Optimization."},{"key":"2626_CR32","doi-asserted-by":"publisher","unstructured":"Jiao, H.W., Ma, J.Q.: An efficient algorithm and complexity result for solving the sum of general affine ratios problem. Chaos soliton. Fract. 164, 112701 (2022). https:\/\/doi.org\/10.1016\/j.chaos.2022.112701","DOI":"10.1016\/j.chaos.2022.112701"},{"issue":"3","key":"2626_CR33","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s11075-022-01471-z","volume":"93","author":"P.P. Shen","year":"2023","unstructured":"Shen, P.P., Wang, Y.F., Wu, D.X.: A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem. Numer. Algor. 93(3), 1373\u20131400 (2023)","journal-title":"Numer. Algor."},{"key":"2626_CR34","doi-asserted-by":"crossref","unstructured":"Huang, B.D., Shen, P.P.: An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems. Chaos Soliton. Fract. 182, 114757 (2024)","DOI":"10.1016\/j.chaos.2024.114757"},{"key":"2626_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1013072027218","volume":"112","author":"H. Benson","year":"2002","unstructured":"Benson, H.: Global optimization algorithm for the nonlinear sum of ratios problem. J Optim Theory Appl 112, 1\u201329 (2002)","journal-title":"J Optim Theory Appl"},{"key":"2626_CR36","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1013869015288","volume":"22","author":"H. Benson","year":"2002","unstructured":"Benson, H.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Glob. Optim. 22, 343\u2013364 (2002)","journal-title":"J. Glob. Optim."},{"key":"2626_CR37","doi-asserted-by":"publisher","first-page":"114144","DOI":"10.1016\/j.chaos.2023.114144","volume":"176","author":"Z.S. Hou","year":"2023","unstructured":"Hou, Z.S., Liu: S.Y.: a spatial branch-reduction-bound algorithm for solving generalized linear fractional problems globally. Chaos Soliton. Fract. 176, 114144 (2023)","journal-title":"Chaos Soliton. Fract."},{"key":"2626_CR38","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s40305-021-00375-4","volume":"11","author":"H.W. Jiao","year":"2023","unstructured":"Jiao, H.W., Shang, Y.L.: Two-level linear relaxation method for generalized linear fractional programming. J. Oper. Res. Soc. China 11, 569\u2013594 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2626_CR39","doi-asserted-by":"crossref","unstructured":"Gao, Y.L., Zhang, B.: Output-space branch-and-bound reduction algorithm for generalized linear fractional-multiplicative programming problem. Chaos soliton. Fract. 175(1), 113924 (2023)","DOI":"10.1016\/j.chaos.2023.113924"},{"issue":"1","key":"2626_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/02331934.2023.2253816","volume":"47","author":"H.W. Jiao","year":"2024","unstructured":"Jiao, H.W., Ma, J.Q.: Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme. Optimization. 47(1), 1\u201332 (2024)","journal-title":"Optimization."},{"key":"2626_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-023-02368-0","volume":"201","author":"H.W. Jiao","year":"2024","unstructured":"Jiao, H.W., Li, B.B., Shang, Y.L.: An outer space approach to tackle generalized affine fractional program problems. J Optim Theory Appl 201, 1\u201335 (2024)","journal-title":"J Optim Theory Appl"},{"key":"2626_CR42","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1008376731013","volume":"15","author":"H. Konno","year":"1999","unstructured":"Konno, H., Abe, N.: Minimization of the sum of three linear fractional functions. J. Glob. Optim. 15, 419\u2013432 (1999)","journal-title":"J. Glob. Optim."},{"key":"2626_CR43","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"M. Kilinc","year":"2018","unstructured":"Kilinc, M., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems in BARON. Optim. Method. Soft. 33, 540\u2013562 (2018)","journal-title":"Optim. Method. Soft."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02626-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02626-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02626-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T18:11:10Z","timestamp":1761847870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02626-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,14]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2626"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02626-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2025,10,14]]},"assertion":[{"value":"7 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}