{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:44:01Z","timestamp":1775018641939,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T00:00:00Z","timestamp":1743724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T00:00:00Z","timestamp":1743724800000},"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10589-025-00679-8","type":"journal-article","created":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T21:53:18Z","timestamp":1743889998000},"page":"1339-1371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule"],"prefix":"10.1007","volume":"91","author":[{"given":"Bingdi","family":"Huang","sequence":"first","affiliation":[]},{"given":"Peiping","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,4]]},"reference":[{"key":"679_CR1","first-page":"359","volume":"69","author":"Y Almogy","year":"1970","unstructured":"Almogy, Y., Levin, O.: Parametric analysis of a multi-stage stochastic shipping problem. Oper. Res. 69, 359\u2013370 (1970)","journal-title":"Oper. Res."},{"key":"679_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-010-9647-8","volume":"146","author":"HP Benson","year":"2010","unstructured":"Benson, H.P.: Branch and bound outer approximation algorithm for sum-of-ratios fractional programs. J. Optim. Theory Appl. 146, 1\u201318 (2010). https:\/\/doi.org\/10.1007\/s10957-010-9647-8","journal-title":"J. Optim. Theory Appl."},{"key":"679_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9174-4","volume-title":"Linear-Fractional Programming: Theory, Methods, Applications, and Software","author":"EB Bajalinov","year":"2003","unstructured":"Bajalinov, E.B.: Linear-Fractional Programming: Theory, Methods, Applications, and Software. Springer, Berlin (2003)"},{"issue":"2","key":"679_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"HP Benson","year":"2007","unstructured":"Benson, H.P.: A simplicial branch and bound duality bounds algorithm for the linear sum of ratios problem. Eur. J. Oper. Res. 182(2), 597\u2013611 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.08.036","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"679_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.orl.2013.04.005","volume":"41","author":"JG Carlsson","year":"2013","unstructured":"Carlsson, J.G., Shi, J.M.: A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension. Oper. Res. Lett. 41(4), 381\u2013389 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.04.005","journal-title":"Oper. Res. Lett."},{"issue":"10","key":"679_CR6","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/0305-0548(96)00008-1","volume":"23","author":"JC Choi","year":"1996","unstructured":"Choi, J.C., Bricker, D.L.: Effectiveness of a geometric programming algorithm for optimization of machining economics models. Comput. Oper. Res. 23(10), 957\u2013961 (1996). https:\/\/doi.org\/10.1016\/0305-0548(96)00008-1","journal-title":"Comput. Oper. Res."},{"key":"679_CR7","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."},{"issue":"3\u20134","key":"679_CR8","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. Naval Res. Logist. Q. 9(3\u20134), 181\u2013186 (1962)","journal-title":"Naval Res. Logist. Q."},{"key":"679_CR9","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. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 707\u2013716 (2000)"},{"key":"679_CR10","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":"679_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83\u2013102 (2001). https:\/\/doi.org\/10.1023\/A:1008316327038","journal-title":"J. Glob. Optim."},{"key":"679_CR12","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3580419","author":"XL Huang","year":"2020","unstructured":"Huang, X.L., Gao, Y.L., Zhang, B., Liu, X.: An effective computational algorithm for the global solution of a class of linear fractional programming. Math. Probl. Eng. (2020). https:\/\/doi.org\/10.1155\/2020\/3580419","journal-title":"Math. Probl. Eng."},{"key":"679_CR13","unstructured":"IBM ILOG CPLEX: IBM ILOG CPLEX 12.3 User\u2019s Manual for CPLEX. 89 (2011)"},{"issue":"3","key":"679_CR14","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"HW 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). https:\/\/doi.org\/10.1016\/j.ejor.2015.01.039","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"679_CR15","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1080\/02331934.2022.2032051","volume":"72","author":"HW Jiao","year":"2022","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 (2022). https:\/\/doi.org\/10.1080\/02331934.2022.2032051","journal-title":"Optimization"},{"key":"679_CR16","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1515\/math-2016-0058","volume":"14","author":"HW Jiao","year":"2016","unstructured":"Jiao, H.W., Liu, S.Y., Yin, J.B., Zhao, Y.F.: Outcome space range reduction method for global optimization of sum of affine ratios problem. Open. Math. 14, 736\u2013746 (2016). https:\/\/doi.org\/10.1515\/math-2016-0058","journal-title":"Open. Math."},{"key":"679_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112682","volume":"164","author":"HW Jiao","year":"2022","unstructured":"Jiao, H.W., Li, B.B.: Solving min-max linear fractional programs based on image space branch-and-bound scheme. Chaos Solitons Fract. 164, 112682 (2022). https:\/\/doi.org\/10.1016\/j.chaos.2022.112682","journal-title":"Chaos Solitons Fract."},{"key":"679_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112701","volume":"164","author":"HW Jiao","year":"2022","unstructured":"Jiao, H.W., Ma, J.Q.: An efficient algorithm and complexity result for solving the sum of general affine ratios problem. Chaos Solitons Fract. 164, 112701 (2022). https:\/\/doi.org\/10.1016\/j.chaos.2022.112701","journal-title":"Chaos Solitons Fract."},{"issue":"2","key":"679_CR19","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1080\/00207160.2021.1909727","volume":"99","author":"HW Jiao","year":"2022","unstructured":"Jiao, H.W., Shang, Y.L., Wang, W.J.: Solving generalized polynomial problem by using new affine relaxed technique. Int. J. Comput. Math. 99(2), 309\u2013331 (2022). https:\/\/doi.org\/10.1080\/00207160.2021.1909727","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"679_CR20","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1051\/ro\/2022061","volume":"56","author":"HW Jiao","year":"2022","unstructured":"Jiao, H.W., Wang, W.J., Yin, J.B., Shang, Y.L.: Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems. RAIRO-Oper. Res. 56(3), 1533\u20131552 (2022)","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"679_CR21","first-page":"195","volume":"18","author":"HW Jiao","year":"2022","unstructured":"Jiao, H.W., Ma, J.Q., Shang, Y.L.: Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem. Pac. J. Optim. 18(1), 195\u2013212 (2022)","journal-title":"Pac. J. Optim."},{"key":"679_CR22","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s40305-021-00375-4","volume":"11","author":"HW 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). https:\/\/doi.org\/10.1007\/s40305-021-00375-4","journal-title":"J. Oper. Res. Soc. China"},{"key":"679_CR23","unstructured":"Jiao, H.W., Shang, Y.L.: Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem. J. Comput. Math. (2024). https:\/\/api.semanticscholar.org\/CorpusID:266885623"},{"key":"679_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-023-02368-0","volume":"201","author":"HW 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). https:\/\/doi.org\/10.1007\/s10957-023-02368-0","journal-title":"J. Optim. Theory Appl."},{"key":"679_CR25","doi-asserted-by":"publisher","unstructured":"Jiao, H.W., Ma, J.Q.: Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme. Optimization (2024). https:\/\/doi.org\/10.1080\/02331934.2023.2253816","DOI":"10.1080\/02331934.2023.2253816"},{"issue":"3","key":"679_CR26","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1051\/ro\/2023075","volume":"57","author":"HW Jiao","year":"2023","unstructured":"Jiao, H.W., Wang, W.J., Ge, L., Shen, P.P., Shang, Y.L.: Efficient algorithm for globally computing the min-max linear fractional programming problem. RAIRO-Oper. Res. 57(3), 1523\u20131537 (2023). https:\/\/doi.org\/10.1051\/ro\/2023075","journal-title":"RAIRO-Oper. Res."},{"key":"679_CR27","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s12190-024-02027-1","volume":"70","author":"HW Jiao","year":"2024","unstructured":"Jiao, H.W., Sun, Y.D., Wang, W.J., Shang, Y.L.: Global algorithm for effectively solving min\u2013max affine fractional programs. J. Appl. Math. Comput. 70, 1787\u20131811 (2024). https:\/\/doi.org\/10.1007\/s12190-024-02027-1","journal-title":"J. Appl. Math. Comput."},{"issue":"8","key":"679_CR28","doi-asserted-by":"publisher","first-page":"5162","DOI":"10.1109\/TWC.2020.2990176","volume":"19","author":"AA Khan","year":"2020","unstructured":"Khan, A.A., Adve, R.S., Yu, W.: Optimizing downlink resource allocation in multiuser mimo networks via fractional programming and the Hungarian algorithm. IEEE. Trans. Wirel. Commun. 19(8), 5162\u20135175 (2020)","journal-title":"IEEE. Trans. Wirel. Commun."},{"issue":"2","key":"679_CR29","doi-asserted-by":"publisher","first-page":"143","DOI":"10.15807\/jorsj.32.143","volume":"32","author":"H Konno","year":"1989","unstructured":"Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32(2), 143\u2013158 (1989). https:\/\/doi.org\/10.15807\/jorsj.32.143","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"3","key":"679_CR30","doi-asserted-by":"publisher","first-page":"295","DOI":"10.15807\/jorsj.39.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). https:\/\/doi.org\/10.15807\/jorsj.39.295","journal-title":"J. Oper. Res. Soc. Jpn. Keiei Kagaku"},{"key":"679_CR31","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). https:\/\/doi.org\/10.1023\/A:1008376731013","journal-title":"J. Glob. Optim."},{"issue":"9","key":"679_CR32","doi-asserted-by":"publisher","first-page":"867","DOI":"10.3390\/math7090867","volume":"7","author":"X Liu","year":"2019","unstructured":"Liu, X., Gao, Y.L., Zhang, B., Tian, F.P.: A new global optimization algorithm for a class of linear fractional programming. Mathematics 7(9), 867 (2019). https:\/\/doi.org\/10.3390\/math7090867","journal-title":"Mathematics"},{"key":"679_CR33","doi-asserted-by":"publisher","first-page":"106234.1","DOI":"10.1016\/j.cie.2019.106234","volume":"140","author":"BA Ozkok","year":"2020","unstructured":"Ozkok, B.A.: An iterative algorithm to solve a linear fractional programming problem. Comput. Ind. Eng. 140, 106234.1-106234.7 (2020). https:\/\/doi.org\/10.1016\/j.cie.2019.106234","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"679_CR34","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"NTH 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). https:\/\/doi.org\/10.1023\/A:1023274721632","journal-title":"J. Glob. Optim."},{"key":"679_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996). https:\/\/doi.org\/10.1007\/BF00138693","journal-title":"J. Glob. Optim."},{"key":"679_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/A:1008340311108","volume":"19","author":"CC Skiscim","year":"2001","unstructured":"Skiscim, C.C., Palocsay, S.W.: Minimum spanning trees with sums of ratios. J. Glob. Optim. 19, 103\u2013120 (2001). https:\/\/doi.org\/10.1023\/A:1008340311108","journal-title":"J. Glob. Optim."},{"key":"679_CR37","volume-title":"Fractional Programming","author":"S Schaible","year":"1995","unstructured":"Schaible, S.: Fractional Programming. Springer, Berlin (1995)"},{"key":"679_CR38","doi-asserted-by":"publisher","first-page":"3240","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"PP 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, 3240\u2013342 (2019). https:\/\/doi.org\/10.1016\/j.cam.2018.10.038","journal-title":"J. Comput. Appl. Math."},{"key":"679_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1186\/s13660-018-1651-9","volume":"2018","author":"PP 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). https:\/\/doi.org\/10.1186\/s13660-018-1651-9","journal-title":"J. Inequal. Appl."},{"issue":"1","key":"679_CR40","first-page":"79","volume":"11","author":"PP Shen","year":"2015","unstructured":"Shen, P.P., Li, W.M., Liang, Y.C.: Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs. Pac. J. Optim. 11(1), 79\u201399 (2015)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"679_CR41","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1137\/18M1164639","volume":"29","author":"LF Wang","year":"2019","unstructured":"Wang, L.F., Xia, Y.: A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere. SIAM J. Optim. 29(3), 1844\u20131869 (2019). https:\/\/doi.org\/10.1137\/18M1164639","journal-title":"SIAM J. Optim."},{"key":"679_CR42","unstructured":"Wang, C.F., Chu, X.Y.: A new branch and bound method for solving sum of linear ratios problem. IAENG Int. J. Appl. Math. 47(3), (2017). https:\/\/api.semanticscholar.org\/CorpusID:35742156"},{"issue":"3","key":"679_CR43","doi-asserted-by":"publisher","first-page":"742","DOI":"10.12011\/1000-6788(2013)3-742","volume":"33","author":"CF Wang","year":"2013","unstructured":"Wang, C.F., Liu, S.Y.: New method for solving nonlinear sum of ratios problem based on simplicial bisection. Syst. Eng. Theory Pract. 33(3), 742\u2013747 (2013). https:\/\/doi.org\/10.12011\/1000-6788(2013)3-742","journal-title":"Syst. Eng. Theory Pract."},{"issue":"1","key":"679_CR44","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.orl.2017.11.010","volume":"46","author":"Y Xia","year":"2018","unstructured":"Xia, Y., Wang, L.F., Wang, S.: Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications. Oper. Res. Lett. 46(1), 76\u201380 (2018). https:\/\/doi.org\/10.1016\/j.orl.2017.11.010","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"679_CR45","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10898-019-00870-2","volume":"77","author":"Y Xia","year":"2020","unstructured":"Xia, Y., Wang, L.F., Wang, X.H.: Globally minimizing the sum of a convex\u2013concave fraction and a convex function based on wave\u2013curve bounds. J. Glob. Optim. 77(2), 301\u2013318 (2020). https:\/\/doi.org\/10.1007\/s10898-019-00870-2","journal-title":"J. Glob. Optim."},{"issue":"1","key":"679_CR46","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1515\/math-2018-0049","volume":"16","author":"YF Zhao","year":"2018","unstructured":"Zhao, Y.F., Zhao, T.: A reduced space branch and bound algorithm for a class of sum of ratios problems. Open. Math. 16(1), 539\u2013552 (2018). https:\/\/doi.org\/10.1515\/math-2018-0049","journal-title":"Open. Math."},{"key":"679_CR47","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1186\/s13660-018-1947-9","volume":"2018","author":"YF Zhao","year":"2018","unstructured":"Zhao, Y.F., Yang, J.J.: Inner approximation algorithm for generalized linear multiplicative programming problems. J. Inequal. Appl. 2018, 354 (2018). https:\/\/doi.org\/10.1186\/s13660-018-1947-9","journal-title":"J. Inequal. Appl."},{"issue":"1","key":"679_CR48","first-page":"42","volume":"35","author":"YH Zhang","year":"2012","unstructured":"Zhang, Y.H., Wang, C.F.: A new global algorithm for sum of linear ratios problem. Acta Math. Appl. Sin. 35(1), 42\u201348 (2012)","journal-title":"Acta Math. Appl. Sin."},{"issue":"3","key":"679_CR49","first-page":"262","volume":"25","author":"YH Zhang","year":"2017","unstructured":"Zhang, Y.H., Wang, C.F.: A new branch and reduce approach for solving generalized linear fractional programming. Eng. Lett. 25(3), 262\u2013267 (2017)","journal-title":"Eng. Lett."},{"issue":"6","key":"679_CR50","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). https:\/\/doi.org\/10.1080\/02331934.2022.2027940","journal-title":"Optimization"},{"issue":"1","key":"679_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595922500105","volume":"22","author":"B Zhang","year":"2022","unstructured":"Zhang, B., Gao, Y.L.: An output-space based branch-and-bound algorithm for sum-of-linear-ratios problem. Asia-Pac. J. Oper. Res. 22(1), 1\u201323 (2022). https:\/\/doi.org\/10.1142\/S0217595922500105","journal-title":"Asia-Pac. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00679-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00679-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00679-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T16:52:54Z","timestamp":1749487974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00679-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,4]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["679"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00679-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,4]]},"assertion":[{"value":"18 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}