{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:59:12Z","timestamp":1764773952109,"version":"3.46.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Numerous industrial fields, like supply chain management, face mixed-integer optimization problems on a regular basis. Such problems typically show a sparse structure and vary in size, as well as complexity. However, in order to satisfy customer demands, it is crucial to find good solutions to all such problems quickly. Current research often focuses on the development of a tailored approach for one specific problem class with a common structure. Information supplied by everyday users is usually overlooked, but may result in a decomposition with weakly connected blocks due to the structural sparsity. Hence, we present three heuristics to exploit decomposition information and analyze their value based on the type of decomposition. In particular, we newly introduce the heuristic Dynamic Partition Search, enhance the Penalty Alternating Direction Method published earlier in a basic form, and extend a framework from literature to Decomposition Kernel Search. All heuristics are implemented in the non-commercial solver SCIP. We examine their performance in a comprehensive computational study across three different test sets. The computational results indicate that knowledge about relevant decomposition information can boost the solution process of mixed-integer optimization problems.<\/jats:p>","DOI":"10.1007\/s10732-025-09572-3","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:29:44Z","timestamp":1761118184000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting user-supplied Decompositions inside Heuristics"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8730-3447","authenticated-orcid":false,"given":"Katrin","family":"Halbig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7144-8657","authenticated-orcid":false,"given":"Adrian","family":"G\u00f6\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1333-8591","authenticated-orcid":false,"given":"Dieter","family":"Weninger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,22]]},"reference":[{"key":"9572_CR1","volume-title":"Constraint Integer Programming. PhD thesis","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis. Technische Universit\u00e4t, Berlin (2007)"},{"issue":"2","key":"9572_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020). https:\/\/doi.org\/10.1287\/ijoc.2018.0857","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9572_CR3","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1137\/17M1162792","volume":"28","author":"I Aliev","year":"2018","unstructured":"Aliev, I., Loera, J.A.D., Eisenbrand, F., Oertel, T., Weismantel, R.: The support of integer optimal solutions. SIAM J. Optim. 28(3), 2152\u20132157 (2018). https:\/\/doi.org\/10.1137\/17M1162792","journal-title":"SIAM J. Optim."},{"key":"9572_CR4","doi-asserted-by":"publisher","unstructured":"Angelelli, E., Mansini, R., Speranza, M.G.: Kernel search: A general heuristic for the multi-dimensional knapsack problem. Computers & Operations Research, 37(11): 2017\u20132026, (2010). ISSN 0305-0548. https:\/\/doi.org\/10.1016\/j.cor.2010.02.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054810000328","DOI":"10.1016\/j.cor.2010.02.002"},{"issue":"1","key":"9572_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10589-010-9326-6","volume":"51","author":"E Angelelli","year":"2012","unstructured":"Angelelli, E., Mansini, R., Speranza, M.G.: Kernel search: A new heuristic framework for portfolio selection. Comput. Optim. Appl. 51(1), 345\u2013361 (2012). https:\/\/doi.org\/10.1007\/s10589-010-9326-6","journal-title":"Comput. Optim. Appl."},{"key":"9572_CR6","doi-asserted-by":"publisher","unstructured":"Battista, G.D., Tamassia, R.: Incremental Planarity Testing (Extended Abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 436\u2013441, (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63515","DOI":"10.1109\/SFCS.1989.63515"},{"key":"9572_CR7","doi-asserted-by":"crossref","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238\u2013252, (1962\/63). http:\/\/eudml.org\/doc\/131533","DOI":"10.1007\/BF01386316"},{"key":"9572_CR8","doi-asserted-by":"publisher","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Operations Research Letters, 41(6): 611\u2013614, (2013). ISSN 0167-6377. https:\/\/doi.org\/10.1016\/j.orl.2013.08.007. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637713001181","DOI":"10.1016\/j.orl.2013.08.007"},{"key":"9572_CR9","unstructured":"Berthold, T.: Heuristic algorithms in global MINLP solvers. PhD thesis, (2014). http:\/\/www.zib.de\/berthold\/Berthold2014.pdf"},{"issue":"1","key":"9572_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10732-014-9271-0","volume":"21","author":"T Berthold","year":"2015","unstructured":"Berthold, T., Hendel, G.: Shift-and-propagate. Journal of Heuristics 21(1), 73\u2013106 (2015). https:\/\/doi.org\/10.1007\/s10732-014-9271-0","journal-title":"Journal of Heuristics"},{"key":"9572_CR11","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van\u00a0der Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig. J.: The SCIP Optimization Suite 8.0. Technical report, Optimization Online, December 2021. http:\/\/www.optimization-online.org\/DB_HTML\/2021\/12\/8728.html"},{"key":"9572_CR12","doi-asserted-by":"publisher","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van\u00a0der Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig. J.: Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw., 49(2), jun (2023). ISSN 0098-3500. https:\/\/doi.org\/10.1145\/3585516","DOI":"10.1145\/3585516"},{"issue":"1","key":"9572_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/S1052623497318682","volume":"9","author":"R Bornd\u00f6rfer","year":"1998","unstructured":"Bornd\u00f6rfer, R., Ferreira, C.E., Martin, A.: Decomposing Matrices into Blocks. SIAM J. Optim. 9(1), 236\u2013269 (1998)","journal-title":"SIAM J. Optim."},{"key":"9572_CR14","doi-asserted-by":"publisher","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011). https:\/\/doi.org\/10.1561\/2200000016. (ISSN 1935-8237)","DOI":"10.1561\/2200000016"},{"key":"9572_CR15","unstructured":"Chv\u00e1tal, V.: Linear programming. A Series of books in the mathematical sciences. Freeman, New York (N. Y.), (1983). ISBN 0-7167-1195-8. http:\/\/opac.inria.fr\/record=b1104676. R\u00e9impressions : 1999, 2000, 2002"},{"key":"9572_CR16","unstructured":"CPLEX. IBM ILOG CPLEX Optimization Studio CPLEX User\u2019s Manual, (2022). https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.1?topic=optimizers-users-manual-cplex"},{"key":"9572_CR17","doi-asserted-by":"publisher","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition Principle for Linear Programs. Oper. Res. 8(1), 101\u2013111 (1960). https:\/\/doi.org\/10.1287\/opre.8.1.101. (ISSN 0030-364X)","DOI":"10.1287\/opre.8.1.101"},{"key":"9572_CR18","unstructured":"Erlangen National High Performance Computing Center (NHR@FAU) . Woody throughput cluster (Tier3), last accessed on 2023-06-20. https:\/\/hpc.fau.de\/systems-services\/documentation-instructions\/clusters\/woody-cluster\/"},{"key":"9572_CR19","doi-asserted-by":"publisher","unstructured":"Fischetti, M., Ljubi\u0107, I., Sinnl, M.: Benders decomposition without separability: A computational study for capacitated facility location problems. European Journal of Operational Research, 253 (3):557 \u2013 569 (2016). ISSN 0377-2217. https:\/\/doi.org\/10.1016\/j.ejor.2016.03.002. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221716301126","DOI":"10.1016\/j.ejor.2016.03.002"},{"key":"9572_CR20","doi-asserted-by":"crossref","unstructured":"Gamrath, G., L\u00fcbbecke, M.E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In P.\u00a0Festa, editor, Experimental Algorithms, pages 239\u2013252, Berlin, Heidelberg, (2010). Springer Berlin Heidelberg","DOI":"10.1007\/978-3-642-13193-6_21"},{"key":"9572_CR21","doi-asserted-by":"publisher","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. Mathematical Programming Computation 7(4), 367\u2013398 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0083-5. (ISSN 1867-2957)","DOI":"10.1007\/s12532-015-0083-5"},{"key":"9572_CR22","doi-asserted-by":"publisher","first-page":"866","DOI":"10.4208\/jcm.1905-m2019-0055","volume":"37","author":"G Gamrath","year":"2019","unstructured":"Gamrath, G., Gleixner, A., Koch, T., Miltenberger, M., Kniasew, D., Schl\u00f6gel, D., Martin, A., Weninger, D.: Tackling industrial-scale supply chain problems by mixed-integer programming. J. Comput. Math. 37, 866\u2013888 (2019). https:\/\/doi.org\/10.4208\/jcm.1905-m2019-0055","journal-title":"J. Comput. Math."},{"key":"9572_CR23","unstructured":"Gamrath, G., Anderson, D., Bestuzheva, K., Chen, W.-K., Eifler, L., Gasse, M., Gemander, P., Gleixner, A., Gottwald, L., Halbig, K., Hendel, G., Hojny, C., Koch, T., Le\u00a0Bodic, P., Maher, S.J., Matter, F., Miltenberger, M., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Tawfik, C., Vigerske, S., Wegscheider, F., Weninger, D., Witzig, J.: The SCIP Optimization Suite 7.0. Technical report, Optimization Online, March (2020). http:\/\/www.optimization-online.org\/DB_HTML\/2020\/03\/7705.html"},{"key":"9572_CR24","doi-asserted-by":"publisher","unstructured":"Gei\u00dfler, B., Morsi, A., Schewe, L., Schmidt, M.: Penalty alternating direction methods for mixed-integer optimization: A new view on feasibility pumps. SIAM J. Optim. 27(3), 1611\u20131636 (2017). https:\/\/doi.org\/10.1137\/16M1069687. (ISSN 2192-4414)","DOI":"10.1137\/16M1069687"},{"key":"9572_CR25","doi-asserted-by":"publisher","unstructured":"Gemander, P., Chen, W.-K., Weninger, D., Gottwald, L., Gleixner, A., Martin, A.: Two-row and two-column mixed-integer presolve using hashing-based pairing methods. EURO Journal on Computational Optimization 8(3), 205\u2013240 (2020). https:\/\/doi.org\/10.1007\/s13675-020-00129-6. (ISSN 2192-4414)","DOI":"10.1007\/s13675-020-00129-6"},{"key":"9572_CR26","doi-asserted-by":"publisher","unstructured":"Geoffrion, A.M.: Approaches to Integer Programming, chapter Lagrangean relaxation for integer programming, pages 82\u2013114. Springer Berlin Heidelberg, Berlin, Heidelberg, (1974). ISBN 978-3-642-00740-8. https:\/\/doi.org\/10.1007\/BFb0120690","DOI":"10.1007\/BFb0120690"},{"key":"9572_CR27","doi-asserted-by":"publisher","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J., L\u00fcbbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D., Shinano, Y., MIPLIB.: Data-Driven Compilation of the 6th Mixed-Integer Programming Library. Math. Program. Comput. 2021,(2017). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","DOI":"10.1007\/s12532-020-00194-3"},{"key":"9572_CR28","doi-asserted-by":"publisher","unstructured":"Guastaroba, G., Savelsbergh, M., Speranza, M.G.: Adaptive kernel search: A heuristic for solving mixed integer linear programs. European Journal of Operational Research, 263 (3):789\u2013804, (2017). ISSN 0377-2217. https:\/\/doi.org\/10.1016\/j.ejor.2017.06.005. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221717305234","DOI":"10.1016\/j.ejor.2017.06.005"},{"key":"9572_CR29","doi-asserted-by":"publisher","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Mathematical Programming 39(2), 215\u2013228 (1987). https:\/\/doi.org\/10.1007\/BF02592954. (ISSN 1436-4646)","DOI":"10.1007\/BF02592954"},{"key":"9572_CR30","doi-asserted-by":"publisher","unstructured":"Gutwenger, C., Mutzel, P.: Graph Drawing: 8th International Symposium, GD 2000 Colonial Williamsburg, VA, USA, September 20\u201323, 2000 Proceedings, chapter A Linear Time Implementation of SPQR-Trees, pages 77\u201390. Springer Berlin Heidelberg, Berlin, Heidelberg, (2001). ISBN 978-3-540-44541-8. https:\/\/doi.org\/10.1007\/3-540-44541-2_8","DOI":"10.1007\/3-540-44541-2_8"},{"key":"9572_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.5486\/PMD.1966.13.1-4.15","volume":"13","author":"F Harary","year":"1966","unstructured":"Harary, F., Prins, G.: The block-cutpoint-tree of a graph. Publicationes Mathematicae Debrecen 13, 103\u2013107 (1966)","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"3","key":"9572_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973). https:\/\/doi.org\/10.1137\/0202012","journal-title":"SIAM J. Comput."},{"key":"9572_CR33","unstructured":"Halbig, K.: Decomposition Heuristics, June (2023). https:\/\/github.com\/khalbig\/decomposition-heuristics. [dataset, software]"},{"key":"9572_CR34","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way Hypergraph Partitioning. In In Proceedings of the Design and Automation Conference, pages 343\u2013348, (1998a)","DOI":"10.1145\/309847.309954"},{"key":"9572_CR35","unstructured":"Karypis, G., Kumar, V.: hMetis: A Hypergraph Partitioning Package, Version 1.5.3, (1998b)"},{"key":"9572_CR36","doi-asserted-by":"crossref","unstructured":"Ralphs, T.K., Galati, M.V.: Decomposition in integer linear programming. In J.\u00a0Karlof, editor, Integer Programming: Theory and Practice, pages 57\u2013110. CRC Press, (2005). https:\/\/coral.ie.lehigh.edu\/~ted\/files\/papers\/DECOMP04.pdf","DOI":"10.1201\/9781420039597.ch4"},{"key":"9572_CR37","unstructured":"SAP SE. SAP Software Solutions | Business Applications and Technology, last accessed on 2023-06-20. https:\/\/www.sap.com"},{"key":"9572_CR38","unstructured":"SAP SE or an SAP affiliate company. MILP Benchmarks CellphoneCo., Jan. (2023). https:\/\/github.com\/SAP-samples\/ibp-sop-benchmarks-milp-cellphoneco. [dataset]"},{"key":"9572_CR39","doi-asserted-by":"publisher","unstructured":"Schewe, L., Schmidt, M., Weninger, D.: A Decomposition Heuristic for Mixed-Integer Supply Chain Problems. Operations Research Letters, 48(3): 225\u2013232, (2020). ISSN 0167-6377. https:\/\/doi.org\/10.1016\/j.orl.2020.02.006. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637720300249","DOI":"10.1016\/j.orl.2020.02.006"},{"key":"9572_CR40","unstructured":"Soumis, F.: Decomposition and Column Generation. In Annotated Bibliographies in Combinatorial Optimization. Chapter 8. A Wiley-interscience publication. Wiley, (1997). ISBN 9780471965749. https:\/\/books.google.de\/books?id=jz4ZAQAAIAAJ"},{"key":"9572_CR41","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Connectivity in graphs. Mathematical Expositions, 15, (1966)","DOI":"10.3138\/9781487584863"},{"key":"9572_CR42","doi-asserted-by":"publisher","unstructured":"Vanderbeck, F., Wolsey, L.A.: Reformulation and Decomposition of Integer Programs. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_13 . (ISBN 978-3-540-68279-0)","DOI":"10.1007\/978-3-540-68279-0_13"},{"key":"9572_CR43","doi-asserted-by":"publisher","unstructured":"Weninger, D., Wolsey, L.A.: Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing. European Journal of Operational Research, (2023). ISSN 0377-2217. https:\/\/doi.org\/10.1016\/j.ejor.2023.02.042. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221723001935","DOI":"10.1016\/j.ejor.2023.02.042"},{"key":"9572_CR44","doi-asserted-by":"publisher","unstructured":"Wolsey, L.A.: Integer Programming. John Wiley and Sons, Ltd, (2020). ISBN 9781119606475. https:\/\/doi.org\/10.1002\/9781119606475. https:\/\/onlinelibrary.wiley.com\/doi\/book\/10.1002\/9781119606475","DOI":"10.1002\/9781119606475"},{"issue":"3","key":"9572_CR45","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1287\/opre.2021.2210","volume":"70","author":"B Y\u0131ld\u0131z","year":"2022","unstructured":"Y\u0131ld\u0131z, B., Boland, N., Savelsbergh, M.: Decomposition branching for mixed integer programming. Oper. Res. 70(3), 1854\u20131872 (2022). https:\/\/doi.org\/10.1287\/opre.2021.2210","journal-title":"Oper. Res."},{"key":"9572_CR46","unstructured":"Zuse Institute Berlin. MIPLIB 2017 \u2013 The Mixed Integer Programming Library, last accessed on 2023-06-20. https:\/\/miplib.zib.de\/. [dataset]"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09572-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09572-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09572-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T14:55:18Z","timestamp":1764773718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09572-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,22]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9572"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09572-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2025,10,22]]},"assertion":[{"value":"24 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 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":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"36"}}