{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:46:34Z","timestamp":1772941594395,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:00:00Z","timestamp":1731801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T00:00:00Z","timestamp":1731801600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10589-024-00622-3","type":"journal-article","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T07:21:58Z","timestamp":1731828118000},"page":"257-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9385-5697","authenticated-orcid":false,"given":"Hezhi","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youmin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huixian","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,17]]},"reference":[{"issue":"11","key":"622_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0898-1221(90)90148-D","volume":"19","author":"F Al-Khayyal","year":"1990","unstructured":"Al-Khayyal, F.: Jointly constrained bilinear programs and related problems: an overview. Comput. Math. Appl. 19(11), 53\u201362 (1990)","journal-title":"Comput. Math. Appl."},{"key":"622_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8, 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"key":"622_CR3","first-page":"359","volume-title":"Operational research","author":"Y Almogy","year":"1970","unstructured":"Almogy, Y., Levin, O.: Parametric analysis of a multi-stage stochastic shipping problem. In: Lawrence, J. (ed.) Operational research, pp. 359\u2013370. Tavistock Publications, London (1970)"},{"key":"622_CR4","doi-asserted-by":"crossref","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":"622_CR5","doi-asserted-by":"crossref","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":"622_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:COAP.0000004976.52180.7f","volume":"27","author":"H Benson","year":"2004","unstructured":"Benson, H.: On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput. Optim. Appl. 27, 5\u201322 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"622_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/B:JOTA.0000026129.07165.5a","volume":"121","author":"H Benson","year":"2004","unstructured":"Benson, H.: On the global optimization of sums of linear fractional functions over a convex set. J. Optim. Theory Appl. 121(1), 19\u201339 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"622_CR8","doi-asserted-by":"crossref","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":"622_CR9","doi-asserted-by":"crossref","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."},{"key":"622_CR10","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":"622_CR11","doi-asserted-by":"crossref","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. 9, 181\u2013186 (1962)","journal-title":"Nav. Res. Logist."},{"key":"622_CR12","first-page":"467","volume":"44","author":"C Colantoni","year":"1969","unstructured":"Colantoni, C., Manes, R., Whinston, A.: Programming, profit rates, and pricing decisions. Account. Rev. 44, 467\u2013481 (1969)","journal-title":"Account. Rev."},{"key":"622_CR13","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1002\/1520-6750(199012)37:6<929::AID-NAV3220370611>3.0.CO;2-8","volume":"37","author":"Z Drezner","year":"1990","unstructured":"Drezner, Z., Schaible, S., Simchi-Levi, D.: Queueing-location problems on the plane. Nav. Res. Logist. 37, 929\u2013935 (1990)","journal-title":"Nav. Res. Logist."},{"key":"622_CR14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1080\/02331930108844543","volume":"49","author":"M Dur","year":"2001","unstructured":"Dur, M., Horst, R., Thoai, N.: Solving sum-of-ratios fractional programs using efficient points. Optimization 49, 447\u2013466 (2001)","journal-title":"Optimization"},{"key":"622_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"J Falk","year":"1994","unstructured":"Falk, J., Palocsay, S.: Image space analysis of generalized fractional programs. J. Glob. Optim. 4, 63\u201388 (1994)","journal-title":"J. Glob. Optim."},{"key":"622_CR16","first-page":"162","volume-title":"Encyclopedia of optimization","author":"J Frenk","year":"2001","unstructured":"Frenk, J., Scheible, S.: Fractional programming. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of optimization, vol. II, pp. 162\u2013172. Kluwer, Dordrecht (2001)"},{"key":"622_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global optimization: deterministic approaches","author":"R Horst","year":"1993","unstructured":"Horst, R., Tuy, H.: Global optimization: deterministic approaches, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"key":"622_CR18","unstructured":"IBM ILOG CPLEX. IBM ILOG CPLEX 12.6 User\u2019s Manual for CPLEX, Version 12.10.0.0 Copyright (c), IBM Corp. (2013). http:\/\/www.cplex.com. Accessed 1 Sept 2023"},{"key":"622_CR19","doi-asserted-by":"crossref","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, 723\u2013730 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"622_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02368-0","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. (2024). https:\/\/doi.org\/10.1007\/s10957-023-02368-0","journal-title":"J. Optim. Theory Appl."},{"key":"622_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.02.039","volume":"239","author":"C Kao","year":"2014","unstructured":"Kao, C.: Network data envelopment analysis: A review. Eur. J. Oper. Res. 239, 1\u201316 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"622_CR22","doi-asserted-by":"crossref","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. Methods Softw. 33, 540\u2013562 (2018)","journal-title":"Optim. Methods Softw."},{"key":"622_CR23","doi-asserted-by":"crossref","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. Glob. Optim. 18, 283\u2013299 (2000)","journal-title":"J. Glob. Optim."},{"key":"622_CR24","first-page":"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, 143\u2013158 (1989)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"622_CR25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01096534","volume":"4","author":"H Konno","year":"1994","unstructured":"Konno, H., Kuno, T., Yajima, Y.: Global minimization of a generalized convex multiplicative function. J. Glob. Optim. 4, 47\u201362 (1994)","journal-title":"J. Glob. Optim."},{"key":"622_CR26","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. J. Oper. Res. Soc. Jpn. 39, 295\u2013306 (1996)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"622_CR27","doi-asserted-by":"crossref","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. Glob. Optim. 1, 65\u201381 (1991)","journal-title":"J. Glob. Optim."},{"key":"622_CR28","doi-asserted-by":"crossref","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."},{"key":"622_CR29","doi-asserted-by":"crossref","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 fractional functions. J. Glob. Optim. 22, 155\u2013174 (2002)","journal-title":"J. Glob. Optim."},{"key":"622_CR30","doi-asserted-by":"crossref","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":"622_CR31","doi-asserted-by":"crossref","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."},{"key":"622_CR32","doi-asserted-by":"crossref","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, 225 (2021)","journal-title":"Comput. Appl. Math."},{"issue":"1","key":"622_CR33","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s12532-018-0142-9","volume":"11","author":"HZ Luo","year":"2019","unstructured":"Luo, H.Z., Bai, X.D., Lim, G., Peng, J.M.: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation. Math. Program. Comput. 11(1), 119\u2013171 (2019)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"622_CR34","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/ijoc.2019.0941","volume":"33","author":"HZ Luo","year":"2021","unstructured":"Luo, H.Z., Ding, X.D., Peng, J.M., Jiang, R.J., Li, D.: Complexity results and effective algorithms for the worst-case linear optimization under uncertainties. INFORMS J. Comput. 33(1), 180\u2013197 (2021)","journal-title":"INFORMS J. Comput."},{"key":"622_CR35","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10589-023-00485-0","volume":"86","author":"HZ Luo","year":"2023","unstructured":"Luo, H.Z., Wu, H.X., Zhang, X.Y., Xu, W.Q.: Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints. Comput. Optim. Appl. 86, 199\u2013240 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"622_CR36","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1111\/mafi.12383","volume":"34","author":"HZ Luo","year":"2024","unstructured":"Luo, H.Z., Chen, Y.Y., Zhang, X.Y., Li, D., Wu, H.X.: Effective algorithms for optimal portfolio deleveraging problem with cross impact. Math. Financ. 34, 36\u201389 (2024)","journal-title":"Math. Financ."},{"key":"622_CR37","doi-asserted-by":"crossref","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. Glob. Optim. 9, 113\u2013119 (1996)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"622_CR38","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G McCormick","year":"1976","unstructured":"McCormick, G.: 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":"622_CR39","first-page":"177","volume":"69","author":"Y Nesterov","year":"1995","unstructured":"Nesterov, Y., Nemirovskii, A.: An interior-point method for generalized linear-fractional programming. Math. Program. 69, 177\u2013204 (1995)","journal-title":"Math. Program."},{"key":"622_CR40","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"N Phuong","year":"2003","unstructured":"Phuong, N., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26, 229\u2013259 (2003)","journal-title":"J. Glob. Optim."},{"key":"622_CR41","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01106605","volume":"6","author":"J Quesada","year":"1995","unstructured":"Quesada, J., Grossmann, I.: A global optimization algorithm for linear fractional and bilinear programs. J. Glob. Optim. 6, 39\u201376 (1995)","journal-title":"J. Glob. Optim."},{"key":"622_CR42","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M Rao","year":"1971","unstructured":"Rao, M.: Cluster analysis and mathematical programming. J. Am. Stat. Assoc. 66, 622\u2013626 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"622_CR43","doi-asserted-by":"crossref","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)","journal-title":"J. Glob. Optim."},{"key":"622_CR44","doi-asserted-by":"crossref","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. Quart. 24, 691\u2013693 (1977)","journal-title":"Nav. Res. Logist. Quart."},{"key":"622_CR45","doi-asserted-by":"crossref","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":"622_CR46","doi-asserted-by":"crossref","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."},{"issue":"1","key":"622_CR47","first-page":"79","volume":"11","author":"P Shen","year":"2015","unstructured":"Shen, P., Li, W., Liang, Y.: Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs. Pacific J. Optim. 11(1), 79\u201399 (2015)","journal-title":"Pacific J. Optim."},{"key":"622_CR48","doi-asserted-by":"crossref","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. Algorithms 93, 1373\u20131400 (2023)","journal-title":"Numer. Algorithms"},{"key":"622_CR49","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H Sherali","year":"1992","unstructured":"Sherali, H., Alameddine, A.: A new reformulation linearization algorithm for bilinear programming problems. J. Glob. Optim. 2, 379\u2013410 (1992)","journal-title":"J. Glob. Optim."},{"key":"622_CR50","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10898-023-01286-9","volume":"87","author":"HX Wu","year":"2023","unstructured":"Wu, H.X., Luo, H.Z., Zhang, X.Y., Qi, H.Q.: An effective global algorithm for worst-case linear optimization under polyhedral uncertainty. J. Glob. Optim. 87, 191\u2013219 (2023)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"622_CR51","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2014.05.013","volume":"239","author":"M Yang","year":"2014","unstructured":"Yang, M., Li, Y., Chen, Y., Liang, L.: An equilibrium efficiency frontier data envelopment analysis approach for evaluating decision-making units with fixed-sum outputs. Eur. J. Oper. Res. 239(2), 479\u2013489 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"622_CR52","first-page":"1","volume":"22","author":"B Zhang","year":"2022","unstructured":"Zhang, B., Gao, Y.: An output-space based branch-and-bound algorithm for sum-of-linear-ratios problem. Asia-Pacific J. Oper. Res. 22(1), 1\u201323 (2022)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"622_CR53","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1007\/s10957-021-01992-y","volume":"192","author":"B Zhang","year":"2022","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems. J. Optim. Theory Appl. 192, 830\u2013855 (2022)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"622_CR54","first-page":"262","volume":"25","author":"Y Zhang","year":"2017","unstructured":"Zhang, Y., Wang, C.: A new branch and reduce approach for solving generalized linear fractional programming. Eng. Lett. 25(3), 262\u2013267 (2017)","journal-title":"Eng. Lett."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00622-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T12:33:09Z","timestamp":1736771589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00622-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,17]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["622"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00622-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,17]]},"assertion":[{"value":"7 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2024","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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}