{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:46:44Z","timestamp":1772941604713,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071133"],"award-info":[{"award-number":["12071133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871196"],"award-info":[{"award-number":["11871196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471287"],"award-info":[{"award-number":["12471287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s40314-024-03063-0","type":"journal-article","created":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T16:54:19Z","timestamp":1736268859000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs"],"prefix":"10.1007","volume":"44","author":[{"given":"Yaping","family":"Deng","sequence":"first","affiliation":[]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,7]]},"reference":[{"key":"3063_CR1","first-page":"359","volume":"69","author":"Y Almogy","year":"1970","unstructured":"Almogy Y, Levin O (1970) Parametric analysis of a multi-stage stochastic shipping problem. Oper Res 69:359\u2013370","journal-title":"Oper Res"},{"key":"3063_CR2","doi-asserted-by":"crossref","unstructured":"Avriel M, Diewert E, Schaible S et al (1988) Generalized concavity, 1st edn. New York, New York","DOI":"10.1007\/978-1-4684-7600-2_1"},{"key":"3063_CR3","doi-asserted-by":"crossref","unstructured":"Benson H (2002a) Global optimization algorithm for the nonlinear sum of ratios problem. J Optim Theory Appl 112:1\u201329","DOI":"10.1023\/A:1013072027218"},{"key":"3063_CR4","unstructured":"Benson H (2002b) Using concave envelopes to globally solve the nonlinear sum of ratios problem. J Glob Optim 22:343\u2013364"},{"key":"3063_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/B:JOTA.0000026129.07165.5a","volume":"121","author":"H Benson","year":"2004","unstructured":"Benson H (2004) On the global optimization of sums of linear fractional functions over a convex set. J Optim Theory Appl 121:19\u201339","journal-title":"J Optim Theory Appl"},{"key":"3063_CR6","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 (2007) A simplicial branch and bound duality bounds algorithm for the linear sum of ratios problem. Eur J Oper Res 182:597\u2013611","journal-title":"Eur J Oper Res"},{"key":"3063_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","volume":"146","author":"H Benson","year":"2010","unstructured":"Benson H (2010) Branch and bound outer approximation algorithm for sum-of-ratios fractional programs. J Optim Theory Appl 146:1\u201318","journal-title":"J Optim Theory Appl"},{"key":"3063_CR8","first-page":"65","volume":"10","author":"A Cambini","year":"1989","unstructured":"Cambini A, Martein L, Schaible S (1989) On maximizing a sum of ratios. J Inf Optim Sci 10:65\u201379","journal-title":"J Inf Optim Sci"},{"issue":"4","key":"3063_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.orl.2013.04.005","volume":"41","author":"JG Carlsson","year":"2013","unstructured":"Carlsson JG, Shi JM (2013) A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension. Oper Res Lett 41(4):381\u2013389","journal-title":"Oper Res Lett"},{"issue":"3\u20134","key":"3063_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes A, Cooper WW (1962) Programming with linear fractional functionals. Nav Res Logist Q 9(3\u20134):181\u2013186","journal-title":"Nav Res Logist Q"},{"key":"3063_CR11","unstructured":"Chen DZ, Daescu O, Dai Y, et al(2000) Optimizing the sum of linear fractional functions and applications. In: Proceedings of the eleventh annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, p 707-716"},{"key":"3063_CR12","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 (2011) Approximation algorithm for linear fractional multiplicative problems. Math Program 128:437\u2013443","journal-title":"Math Program"},{"key":"3063_CR13","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/276245","volume":"2013","author":"YL Gao","year":"2013","unstructured":"Gao YL, Jin SQ (2013) A global optimization algorithm for sum of linear ratios problem. J Appl Math 2013:276245","journal-title":"J Appl Math"},{"key":"3063_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2024.114757","volume":"182","author":"BD Huang","year":"2024","unstructured":"Huang BD, Shen PP (2024) An efficient branch and bound reduction algorithm for globally solving linear fractional programming problems. Chaos Solitons Fract 182:114757","journal-title":"Chaos Solitons Fract"},{"key":"3063_CR15","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/490297","volume":"2014","author":"HW Jiao","year":"2014","unstructured":"Jiao HW, Chen YQ (2014) A new linearizing method for sum of linear ratios problem with coefficients. J Appl Math 2014:490297","journal-title":"J Appl Math"},{"issue":"3","key":"3063_CR16","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"HW Jiao","year":"2015","unstructured":"Jiao HW, Liu SY (2015) A practicable branch and bound algorithm for sum of linear ratios problem. Eur J Oper Res 243(3):723\u2013730","journal-title":"Eur J Oper Res"},{"key":"3063_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112701","volume":"164","author":"HW Jiao","year":"2022","unstructured":"Jiao HW, Ma JQ (2022) An efficient algorithm and complexity result for solving the sum of general affine ratios problem. Chaos Solitons Fract 164:112701","journal-title":"Chaos Solitons Fract"},{"key":"3063_CR18","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/646205","volume":"2008","author":"HW Jiao","year":"2008","unstructured":"Jiao HW, Feng QG, Shen PP et al (2008) Global optimization for sum of linear ratios problem using new pruning technique. Math Probl Eng 2008:646205","journal-title":"Math Probl Eng"},{"issue":"6","key":"3063_CR19","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1080\/02331934.2022.2032051","volume":"72","author":"HW Jiao","year":"2023","unstructured":"Jiao HW, Shang YL, Chen RJ (2023) A potential practical algorithm for minimizing the sum of affine fractional functions. Optimization 72(6):1577\u20131607","journal-title":"Optimization"},{"issue":"3","key":"3063_CR20","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 MK et al (2008) Practical global optimization for multiview geometry. Int J Comput Vis 79(3):271\u2013284","journal-title":"Int J Comput Vis"},{"key":"3063_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1023\/A:1008376731013","volume":"15","author":"H Konno","year":"1999","unstructured":"Konno H, Abe N (1999) Minimization of the sum of three linear fractional functions. J Glob Optim 15:419\u2013432","journal-title":"J Glob Optim"},{"issue":"2","key":"3063_CR22","first-page":"143","volume":"32","author":"H Konno","year":"1989","unstructured":"Konno H, Inori M (1989) Bond portfolio optimization by bilinear fractional programming. J Oper Res Soc Jpn 32(2):143\u2013158","journal-title":"J Oper Res Soc Jpn"},{"issue":"3","key":"3063_CR23","first-page":"295","volume":"39","author":"H Konno","year":"1996","unstructured":"Konno H, Watanabe H (1996) Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach. J Oper Res Soc 39(3):295\u2013306","journal-title":"J Oper Res Soc"},{"key":"3063_CR24","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 (1999) Minimizing sums and products of linear fractional functions over a polytope. Nav Res Logist 46:583\u2013596","journal-title":"Nav Res Logist"},{"key":"3063_CR25","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 (1991) Parametric simplex algorithms for solving a special class of nonconvex minimization problem. J Glob Optim 1:65\u201381","journal-title":"J Glob Optim"},{"key":"3063_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013807129844","volume":"22","author":"T Kuno","year":"2002","unstructured":"Kuno T (2002) A branch-and-bound algorithm for maximizing the sum of several linear ratios. J Glob Optim 22:155\u2013174","journal-title":"J Glob Optim"},{"key":"3063_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10898-004-1952-z","volume":"33","author":"T Kuno","year":"2005","unstructured":"Kuno T (2005) A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-rations problems. J Glob Optim 33:215\u2013234","journal-title":"J Glob Optim"},{"key":"3063_CR28","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 (2013) A practical but rigorous approach to sum-of-ratios optimization in geometric applications. Comput Optim Appl 54:93\u2013109","journal-title":"Comput Optim Appl"},{"key":"3063_CR29","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s40314-021-01614-3","volume":"40","author":"SY Liu","year":"2021","unstructured":"Liu SY, Ge L (2021) An outcome space algorithm for minimizing a class of linear ratio optimization problems. Comput Appl Math 40:225","journal-title":"Comput Appl Math"},{"key":"3063_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui T (1996) NP-hardness of linear multiplicative programming and related problems. J Glob Optim 9:113\u2013119","journal-title":"J Glob Optim"},{"key":"3063_CR31","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01585557","volume":"69","author":"YE Nesterov","year":"1995","unstructured":"Nesterov YE, Nemirovskii AS (1995) An interior-point method for generalized linear-fractional programming. Math Program 69:177\u2013204","journal-title":"Math Program"},{"issue":"3","key":"3063_CR32","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"NTH Phuong","year":"2003","unstructured":"Phuong NTH, Tuy H (2003) A unified monotonic approach to generalized linear fractional programming. J Glob Optim 26(3):229\u2013259","journal-title":"J Glob Optim"},{"key":"3063_CR33","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis NV (1996) BARON: A general purpose global optimization software package. J Glob Optim 8:201\u2013205","journal-title":"J Glob Optim"},{"key":"3063_CR34","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1002\/nav.3800240416","volume":"24","author":"S Schaible","year":"1977","unstructured":"Schaible S (1977) A note on the sum of a linear and linear-fractional function. Nav Res Logist Q 24:691\u2013693","journal-title":"Nav Res Logist Q"},{"key":"3063_CR35","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S Schaible","year":"2003","unstructured":"Schaible S, Shi J (2003) Fractional programming: the sum-of-ratios case. Optim Methods Softw 18:219\u2013229","journal-title":"Optim Methods Softw"},{"key":"3063_CR36","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1186\/s13660-018-1651-9","volume":"2018","author":"PP Shen","year":"2018","unstructured":"Shen PP, Lu T (2018) Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J Inequal Appl 2018:63","journal-title":"J Inequal Appl"},{"issue":"1","key":"3063_CR37","first-page":"79","volume":"11","author":"PP Shen","year":"2015","unstructured":"Shen PP, Li WM, Liang YC (2015) Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs. Pac J Optim 11(1):79\u201399","journal-title":"Pac J Optim"},{"key":"3063_CR38","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"PP Shen","year":"2019","unstructured":"Shen PP, Huang BD, Wang LF (2019) Range division and linearization algorithm for a class of linear ratios optimization problems. J Comput Appl Math 350:324\u2013342","journal-title":"J Comput Appl Math"},{"issue":"3","key":"3063_CR39","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s11075-022-01471-z","volume":"93","author":"PP Shen","year":"2023","unstructured":"Shen PP, Wang YF, Wu DX (2023) A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem. Numer Algorithms 93(3):1373\u20131400","journal-title":"Numer Algorithms"},{"issue":"1","key":"3063_CR40","first-page":"281","volume":"204","author":"CF Wang","year":"2008","unstructured":"Wang CF, Shen PP (2008) A global optimization algorithm for linear fractional programming. Appl Math Comput 204(1):281\u2013287","journal-title":"Appl Math Comput"},{"issue":"2","key":"3063_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595922500105","volume":"40","author":"B Zhang","year":"2023","unstructured":"Zhang B, Gao YL (2023) An output-space based branch-and-bound algorithm for sum-of-linear-ratios problem. Asia Pac J Oper Res 40(2):1\u201323","journal-title":"Asia Pac J Oper Res"},{"issue":"6","key":"3063_CR42","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1080\/02331934.2022.2027940","volume":"72","author":"B Zhang","year":"2022","unstructured":"Zhang B, Gao YL, Liu X et al (2022) A new deterministic global computing algorithm for solving a kind of linear fractional programming. Optimization 72(6):1485\u20131513","journal-title":"Optimization"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03063-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03063-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03063-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T06:06:26Z","timestamp":1741932386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03063-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,7]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["3063"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03063-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,7]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 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":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"107"}}