{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T16:05:15Z","timestamp":1777046715505,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"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,4]]},"DOI":"10.1007\/s12190-026-02787-y","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:05:00Z","timestamp":1773659100000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient image space algorithm for solving a class of nonconvex programming problems"],"prefix":"10.1007","volume":"72","author":[{"given":"Kun","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"issue":"2","key":"2787_CR1","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."},{"key":"2787_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-1-4757-5331-8_10","volume-title":"Global Optimization in Engineering Design, Nonconvex Optimization and Its Applications","author":"I. Quesada","year":"1996","unstructured":"Quesada, I., Grossmann, I.E.: Alternative bounding approximations for the global optimization of various engineering design problems. In: Grossmann, I.E. (ed.): Global Optimization in Engineering Design, Nonconvex Optimization and Its Applications, vol. 9, pp. 309\u2013331. Kluwer Academic Publishers, Norwell, MA (1996)"},{"key":"2787_CR3","volume-title":"Fractional Programming: theory, Methods and Applications","author":"I.M. Stancu-Minasian","year":"2012","unstructured":"Stancu-Minasian, I.M.: Fractional programming: theory, methods and applications. Springer Science & Business Media (2012)"},{"key":"2787_CR4","first-page":"156","volume":"26","author":"K.P. Bennett","year":"1994","unstructured":"Bennett, K.P.: Global tree optimization: a non-greedy decision tree algorithm. Comput. Sci. Stat. 26, 156\u2013160 (1994)","journal-title":"Comput. Sci. Stat."},{"key":"2787_CR5","unstructured":"Markowitz, H.M.: Portfolio Selection, 2nd edn. Basil Blackwell Inc, Oxford (1991)"},{"issue":"3","key":"2787_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01096774","volume":"3","author":"T. Kuno","year":"1993","unstructured":"Kuno, T., Yajima, Y., Konno, H.: An outer approximation method for minimizing the product of several convex functions on a convex set. J. Global Optim. 3(3), 325\u2013335 (1993)","journal-title":"J. Global Optim."},{"issue":"10","key":"2787_CR7","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1080\/02331934.2013.852548","volume":"63","author":"R. Cambini","year":"2014","unstructured":"Cambini, R., Sodini, C.: On the minimization of a class of generalized linear functions on a flow polytope. Optimization 63(10), 1449\u20131464 (2014)","journal-title":"Optimization"},{"issue":"3","key":"2787_CR8","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.ejor.2019.07.010","volume":"289","author":"C.H. Park","year":"2021","unstructured":"Park, C.H., Lim, H.: A parametric approach to integer linear fractional programming: Newton and Hybrid-Newton methods for an optimal road maintenance problem. Eur. J. Oper. Res. 289(3), 1030\u20131039 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2787_CR9","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ejor.2022.06.006","volume":"305","author":"A.N. Boddiford","year":"2023","unstructured":"Boddiford, A.N., Kaufman, D.E., Skipper, D.E., Uhan, N.A.: Approximating a linear multiplicative objective in watershed management optimization. Eur. J. Oper. Res. 305(2), 547\u2013561 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2787_CR10","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ejor.2021.01.025","volume":"294","author":"S. Dias","year":"2021","unstructured":"Dias, S., Brito, P., Amaral, P.: Discriminant analysis of distributional data via fractional programming. Eur. J. Oper. Res. 294(1), 206\u2013218 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2787_CR11","first-page":"97","volume":"19","author":"H. Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shen, P.: Piecewise linear relaxation method for globally solving a class of multiplicative problems. Pac. J. Optim. 19(1), 97\u2013118 (2023)","journal-title":"Pac. J. Optim."},{"key":"2787_CR12","doi-asserted-by":"publisher","first-page":"114784","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"H. Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shang, Y.: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problem. J. Comput. Appl. Math. 419, 114784 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"2787_CR13","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1051\/ro\/2022061","volume":"56","author":"H. Jiao","year":"2022","unstructured":"Jiao, H., Wang, W., Yin, J., Shang, Y.: 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":"2787_CR14","first-page":"328","volume":"183","author":"P. Shen","year":"2006","unstructured":"Shen, P., Jiao, H.: Linearization method for a class of multiplicative programming with exponent. Appl. Math. Comput. 183(1), 328\u2013336 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2787_CR15","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.cam.2008.03.031","volume":"223","author":"X.G. Zhou","year":"2009","unstructured":"Zhou, X.G., Wu, K.: A method of acceleration for a class of multiplicative programming problems with exponent. J. Comput. Appl. Math. 223(2), 975\u2013982 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"2787_CR16","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s11590-018-1378-z","volume":"14","author":"P. Shen","year":"2020","unstructured":"Shen, P., Huang, B.: Global algorithm for solving linear multiplicative programming problems. Optim. Lett. 14(3), 693\u2013710 (2020)","journal-title":"Optim. Lett."},{"key":"2787_CR17","doi-asserted-by":"publisher","first-page":"114080","DOI":"10.1016\/j.cam.2021.114080","volume":"407","author":"C. Wang","year":"2022","unstructured":"Wang, C., Deng, Y., Shen, P.: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J. Comput. Appl. Math. 407, 114080 (2022)","journal-title":"J. Comput. Appl. Math."},{"key":"2787_CR18","doi-asserted-by":"publisher","first-page":"162245","DOI":"10.1109\/ACCESS.2019.2951515","volume":"7","author":"J. Yin","year":"2019","unstructured":"Yin, J., Jiao, H., Shang, Y.: Global algorithm for generalized affine multiplicative programming problem. IEEE Access 7, 162245\u2013162253 (2019)","journal-title":"IEEE Access"},{"issue":"2","key":"2787_CR19","first-page":"494","volume":"179","author":"Y.L. Gao","year":"2006","unstructured":"Gao, Y.L., Xu, C.X., Yan, Y.L.: An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 179(2), 494\u2013505 (2006)","journal-title":"Appl. Math. Comput."},{"key":"2787_CR20","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1008308913266","volume":"4","author":"X.J. Liu","year":"1999","unstructured":"Liu, X.J., Umegaki, T., Yamamoto, Y.: Heuristic methods for linear multiplicative programming. J. Global Optim. 4, 433\u2013447 (1999)","journal-title":"J. Global Optim."},{"key":"2787_CR21","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"H.S. Ryoo","year":"2003","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of multiplicative programs. J. Global Optim. 26, 387\u2013418 (2003)","journal-title":"J. Global Optim."},{"issue":"3","key":"2787_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.3390\/math8030315","volume":"8","author":"B. Zhang","year":"2020","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8(3), 315 (2020)","journal-title":"Mathematics"},{"issue":"1","key":"2787_CR23","first-page":"117","volume":"164","author":"Y. Gao","year":"2005","unstructured":"Gao, Y., Xu, C., Wang, Y., Zhang, L.: A new two-level linear relaxed bound method for geometric programming problems. Appl. Math. Comput. 164(1), 117\u2013131 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"2787_CR24","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"C.D. Maranas","year":"1997","unstructured":"Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351\u2013369 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"2787_CR25","first-page":"353","volume":"162","author":"P. Shen","year":"2005","unstructured":"Shen, P.: Linearization method of global optimization for generalized geometric programming. Appl. Math. Comput. 162(1), 353\u2013370 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"2787_CR26","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s10898-012-9933-0","volume":"56","author":"P. Shen","year":"2013","unstructured":"Shen, P., Li, X.: Branch-reduction-bound algorithm for generalized geometric programming. J. Global Optim. 56(3), 1123\u20131142 (2013)","journal-title":"J. Global Optim."},{"issue":"1","key":"2787_CR27","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.ejor.2005.11.037","volume":"178","author":"J.F. Tsai","year":"2007","unstructured":"Tsai, J.F., Lin, M.H., Hu, Y.C.: On generalized geometric programming problems with non-positive variables. Eur. J. Oper. Res. 178(1), 10\u201319 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2787_CR28","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2015.01.038","volume":"245","author":"C.L. Tseng","year":"2015","unstructured":"Tseng, C.L., Zhan, Y., Zheng, Q.P., Kumar, M.: A MILP formulation for generalized geometric programming using piecewise-linear approximations. Eur. J. Oper. Res. 245(2), 360\u2013370 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"2787_CR29","first-page":"722","volume":"168","author":"Y.J. Wang","year":"2005","unstructured":"Wang, Y.J., Liang, Z.A.: A deterministic global optimization algorithm for generalized geometric programming. Appl. Math. Comput. 168, 722\u2013737 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2787_CR30","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"H.P. 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)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"2787_CR31","doi-asserted-by":"publisher","first-page":"4410","DOI":"10.3934\/jimo.2022135","volume":"19","author":"H. Jiao","year":"2023","unstructured":"Jiao, H., Ma, J., Shen, P., Qiu, Y.: Effective algorithm and computational complexity for solving sum of linear ratios problem. J. Ind. Manag. Optim. 19(6), 4410\u20134427 (2023)","journal-title":"J. Ind. Manag. Optim."},{"key":"2787_CR32","doi-asserted-by":"publisher","first-page":"112701","DOI":"10.1016\/j.chaos.2022.112701","volume":"164","author":"H. Jiao","year":"2022","unstructured":"Jiao, H., Ma, J.: An efficient algorithm and complexity result for solving the sum of general ratios problem. Chaos Solitons Fractals. 164, 112701 (2022)","journal-title":"Chaos, Solitons Fractals"},{"issue":"3","key":"2787_CR33","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(3), 569\u2013594 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"2","key":"2787_CR34","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1080\/00207160.2021.1909727","volume":"99","author":"H. Jiao","year":"2022","unstructured":"Jiao, H., Shang, Y., Wang, W.: Solving generalized polynomial problem by using new affine relaxed technique. Int. J. Comput. Math. 99(2), 309\u2013331 (2022)","journal-title":"Int. J. Comput. Math."},{"issue":"3","key":"2787_CR35","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"N.T.H. Phuony","year":"2003","unstructured":"Phuony, N.T.H., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Global Optim. 26(3), 229\u2013259 (2003)","journal-title":"J. Global Optim."},{"issue":"2","key":"2787_CR36","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1016\/j.na.2008.02.005","volume":"70","author":"H. Jiao","year":"2009","unstructured":"Jiao, H.: A branch and bound algorithm for globally solving a class of nonconvex programming problems. Nonlinear Anal. 70(2), 1113\u20131123 (2009)","journal-title":"Nonlinear Anal."},{"issue":"7\u20138","key":"2787_CR37","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1016\/j.na.2009.01.142","volume":"71","author":"P. Shen","year":"2009","unstructured":"Shen, P., Bai, X., Li, W.: A new accelerating method for globally solving a class of nonconvex programming problems. Nonlinear Anal. 71(7\u20138), 2866\u20132876 (2009)","journal-title":"Nonlinear Anal."},{"key":"2787_CR38","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1007\/s10589-025-00679-8","volume":"91","author":"B. Huang","year":"2025","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. 91, 1339\u20131371 (2025)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"2787_CR39","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1080\/02331934.2022.2032051","volume":"72","author":"H. Jiao","year":"2023","unstructured":"Jiao, H., Shang, Y., Chen, R.: A potential practical algorithm for minimizing the sum of affine fractional functions. Optimization 72(6), 1577\u20131607 (2023)","journal-title":"Optimization"},{"issue":"1","key":"2787_CR40","doi-asserted-by":"publisher","first-page":"203","DOI":"10.4208\/jcm.2203-m2021-0085","volume":"43","author":"H. Jiao","year":"2025","unstructured":"Jiao, H., Shang, Y.: Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem. J. Comput. Math. 43(1), 203\u2013228 (2025)","journal-title":"J. Comput. Math."},{"issue":"1","key":"2787_CR41","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."},{"key":"2787_CR42","doi-asserted-by":"publisher","first-page":"116070","DOI":"10.1016\/j.cam.2024.116070","volume":"451","author":"Z. Hou","year":"2024","unstructured":"Hou, Z., Liu, S.: An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications. J. Comput. Appl. Math. 451, 116070 (2024)","journal-title":"J. Comput. Appl. Math."},{"issue":"23\u201324","key":"2787_CR43","doi-asserted-by":"publisher","first-page":"7568","DOI":"10.1016\/j.apm.2015.03.025","volume":"39","author":"H.W. Jiao","year":"2015","unstructured":"Jiao, H.W., Liu, S.Y., Zhao, Y.F.: Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints. Appl. Math. Modell. 39(23\u201324), 7568\u20137582 (2015)","journal-title":"Appl. Math. Modell."},{"key":"2787_CR44","unstructured":"Eastman, W.L.: Linear programming with pattern constraints. Ph.D. Thesis. 1958. Department of Economics, Harvard University, Cambridge, Mas-sachusetts, USA"},{"key":"2787_CR45","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28, 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"1","key":"2787_CR46","doi-asserted-by":"publisher","first-page":"84","DOI":"10.2307\/1907744","volume":"25","author":"H.M. Markowitz","year":"1957","unstructured":"Markowitz, H.M., Manne, A.S.: On the solution of discrete programming problems. Econometrica 25(1), 84\u2013110 (1957)","journal-title":"Econometrica"},{"issue":"9","key":"2787_CR47","doi-asserted-by":"publisher","first-page":"2573","DOI":"10.1016\/j.cor.2008.11.002","volume":"36","author":"Y. Chen","year":"2009","unstructured":"Chen, Y., Jiao, H.: A nonisolated optimal solution of general linear multiplicative programming problems. Comput. Oper. Res. 36(9), 2573\u20132579 (2009)","journal-title":"Comput. Oper. Res."},{"key":"2787_CR48","first-page":"717","volume":"183","author":"H. Jiao","year":"2006","unstructured":"Jiao, H., Guo, Y., Shen, P.: Global optimization of generalized linear fractional programming with nonlinear constraints. Appl. Math. Comput. 183, 717\u2013728 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"2787_CR49","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s12190-012-0602-8","volume":"41","author":"Y. Pei","year":"2013","unstructured":"Pei, Y., Zhu, D.: Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region. J. Appl. Math. Comput. 41(1), 153\u2013169 (2013)","journal-title":"J. Appl. Math. Comput."},{"issue":"6","key":"2787_CR50","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1016\/j.apm.2011.09.002","volume":"36","author":"C.F. Wang","year":"2012","unstructured":"Wang, C.F., Liu, S.Y., Shen, P.P.: Global minimization of a generalized linear multiplicative programming. Appl. Math. Modell. 36(6), 2446\u20132451 (2012)","journal-title":"Appl. Math. Modell."},{"issue":"1","key":"2787_CR51","first-page":"281","volume":"204","author":"C.F. Wang","year":"2008","unstructured":"Wang, C.F., Shen, P.P.: A global optimization algorithm for linear fractional programming. Appl. Math. Comput. 204(1), 281\u2013287 (2008)","journal-title":"Appl. Math. Comput."},{"key":"2787_CR52","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"P. Shen","year":"2019","unstructured":"Shen, P., Huang, B., Wang, L.: 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."},{"key":"2787_CR53","doi-asserted-by":"publisher","first-page":"1","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, 1\u201317 (2021)","journal-title":"Comput. Appl. Math."},{"issue":"3","key":"2787_CR54","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A. Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02787-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-026-02787-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-026-02787-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:02:54Z","timestamp":1777042974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-026-02787-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2787"],"URL":"https:\/\/doi.org\/10.1007\/s12190-026-02787-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]},"assertion":[{"value":"18 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 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 declared that they have no conflicts of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"147"}}