{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T14:45:27Z","timestamp":1785336327530,"version":"3.55.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:00:00Z","timestamp":1717459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T00:00:00Z","timestamp":1717459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Handling symmetries in optimization problems is essential for devising efficient solution methods. In this article, we present a general framework that captures many of the already existing symmetry handling methods. While these methods are mostly discussed independently from each other, our framework allows to apply different methods simultaneously and thus outperforming their individual effect. Moreover, most existing symmetry handling methods only apply to binary variables. Our framework allows to easily generalize these methods to general variable types. Numerical experiments confirm that our novel framework is superior to the state-of-the-art symmetry handling methods as implemented in the solver  on a broad set of instances.\n<\/jats:p>","DOI":"10.1007\/s10107-024-02102-2","type":"journal-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T15:04:46Z","timestamp":1717513486000},"page":"217-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A unified framework for symmetry handling"],"prefix":"10.1007","volume":"212","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2494-0705","authenticated-orcid":false,"given":"Jasper","family":"van Doornmalen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5324-8996","authenticated-orcid":false,"given":"Christopher","family":"Hojny","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,4]]},"reference":[{"issue":"3","key":"2102_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"2102_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, vol. 3. Springer, Berlin, Heidelberg (1996)"},{"key":"2102_CR3","doi-asserted-by":"publisher","DOI":"10.3390\/pr7110838","author":"G Kouyialis","year":"2019","unstructured":"Kouyialis, G., Wang, X., Misener, R.: Symmetry detection for quadratic optimization using binary layered graphs. Processes (2019). https:\/\/doi.org\/10.3390\/pr7110838","journal-title":"Processes"},{"key":"2102_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-1927-3_9","volume-title":"Mixed Integer Nonlinear Programming. IMA Series","author":"L Liberti","year":"2011","unstructured":"Liberti, L.: Symmetry in mathematical programming. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming. IMA Series, vol. 154, pp. 263\u2013283. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_9"},{"issue":"1","key":"2102_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s12532-018-0140-y","volume":"11","author":"ME Pfetsch","year":"2018","unstructured":"Pfetsch, M.E., Rehn, T.: A computational comparison of symmetry handling methods for mixed integer programs. Math. Program. Comput. 11(1), 37\u201393 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0140-y","journal-title":"Math. Program. Comput."},{"key":"2102_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-019-01457-1","volume":"186","author":"P Bendotti","year":"2021","unstructured":"Bendotti, P., Fouilhoux, P., Rottner, C.: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem. Math. Program. 186, 337\u2013372 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01457-1","journal-title":"Math. Program."},{"key":"2102_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73556-4_17","volume-title":"Combinatorial Optimization and Applications","author":"EJ Friedman","year":"2007","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A., Xu, Y., Zhu, B. (eds.) Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol. 4616, pp. 146\u2013153. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_17"},{"key":"2102_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.dam.2020.03.002","volume":"283","author":"C Hojny","year":"2020","unstructured":"Hojny, C.: Packing, partitioning, and covering symresacks. Discrete Appl. Math. 283, 689\u2013717 (2020). https:\/\/doi.org\/10.1016\/j.dam.2020.03.002","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"2102_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10107-018-1239-7","volume":"175","author":"C Hojny","year":"2018","unstructured":"Hojny, C., Pfetsch, M.E.: Polytopes associated with symmetry handling. Math. Program. 175(1\u20132), 197\u2013240 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1239-7","journal-title":"Math. Program."},{"issue":"4","key":"2102_CR10","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discrete Optim. 8(4), 595\u2013610 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2011.07.001","journal-title":"Discrete Optim."},{"issue":"1","key":"2102_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes. Math. Program. 114(1), 1\u201336 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0081-5","journal-title":"Math. Program."},{"key":"2102_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-85097-7_31","volume-title":"Combinatorial Optimization and Applications","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Automatic generation of symmetry-breaking constraints. In: Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol. 5165, pp. 328\u2013338. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-85097-7_31"},{"issue":"1\u20132","key":"2102_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-010-0351-0","volume":"131","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1\u20132), 273\u2013304 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0351-0","journal-title":"Math. Program."},{"key":"2102_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10898-013-0106-6","volume":"60","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Ostrowski, J.: Stabilizer-based symmetry breaking constraints for mathematical programs. J. Global Optim. 60, 183\u2013194 (2014)","journal-title":"J. Global Optim."},{"issue":"1\u20133","key":"2102_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F Margot","year":"2003","unstructured":"Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. 98(1\u20133), 3\u201321 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0394-6","journal-title":"Math. Program."},{"key":"2102_CR16","unstructured":"Ostrowski, J.: Symmetry in Integer Programming. PhD Dissertation, Lehigh University (2009)"},{"issue":"1","key":"2102_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0273-x","journal-title":"Math. Program."},{"issue":"1","key":"2102_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94(1), 71\u201390 (2002). https:\/\/doi.org\/10.1007\/s10107-002-0358-2","journal-title":"Math. Program."},{"key":"2102_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0799-3","volume-title":"Groups and Representations","author":"JL Alperin","year":"1995","unstructured":"Alperin, J.L., Bell, R.B.: Groups and Representations. Springer, New York (1995)"},{"key":"2102_CR20","unstructured":"Salvagnin, D.: A Dominance Procedure for Integer Programming. Master\u2019s Thesis, University of Padova, Padova, Italy (2005)"},{"key":"2102_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_17","author":"F Margot","year":"2009","unstructured":"Margot, F.: Symmetry in integer linear programming. 50 Years Integer Program. 1958\u20132008 (2009). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_17","journal-title":"50 Years Integer Program. 1958\u20132008"},{"issue":"10","key":"2102_CR22","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47(10), 1396\u20131407 (2001). https:\/\/doi.org\/10.1287\/mnsc.47.10.1396.10265","journal-title":"Manag. Sci."},{"key":"2102_CR23","doi-asserted-by":"publisher","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC \u201983. ACM Press, New York (1983). https:\/\/doi.org\/10.1145\/800061.808746","DOI":"10.1145\/800061.808746"},{"key":"2102_CR24","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.0060","author":"J Doornmalen","year":"2014","unstructured":"Doornmalen, J., Hojny, C.: Efficient propagation techniques for handling cyclic symmetries in binary programs. INFORMS J. Comput. (2014). https:\/\/doi.org\/10.1287\/ijoc.2022.0060","journal-title":"INFORMS J. Comput."},{"key":"2102_CR25","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., 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 (2021). http:\/\/www.optimization-online.org\/DB_HTML\/2021\/12\/8728.html"},{"issue":"1","key":"2102_CR26","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2006.10.008","volume":"4","author":"F Margot","year":"2007","unstructured":"Margot, F.: Symmetric ILP: coloring and small integers. Discrete Optim. 4(1), 40\u201362 (2007). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.008","journal-title":"Discrete Optim."},{"key":"2102_CR27","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-93031-2_37","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"D Salvagnin","year":"2018","unstructured":"Salvagnin, D.: Symmetry breaking inequalities from the Schreier-Sims table. In: Hoeve, W.-J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 521\u2013529. Springer, Dordrecht (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_37"},{"issue":"2","key":"2102_CR28","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1287\/ijoo.2019.0044","volume":"3","author":"J Linderoth","year":"2021","unstructured":"Linderoth, J., Ares, J., Ostrowski, J., Rossi, F., Smriglio, S.: Orbital conflict: cutting planes for symmetric integer programs. INFORMS J Optim. 3(2), 139\u2013153 (2021). https:\/\/doi.org\/10.1287\/ijoo.2019.0044","journal-title":"INFORMS J Optim."},{"issue":"8","key":"2102_CR29","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/0740817X.2010.541899","volume":"43","author":"A Ghoniem","year":"2011","unstructured":"Ghoniem, A., Sherali, H.D.: Defeating symmetry in combinatorial optimization via objective perturbations and hierarchical constraints. IIE Trans. 43(8), 575\u2013588 (2011). https:\/\/doi.org\/10.1080\/0740817X.2010.541899","journal-title":"IIE Trans."},{"key":"2102_CR30","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S1571-0653(04)00254-9","volume":"7","author":"IM D\u00edaz","year":"2001","unstructured":"D\u00edaz, I.M., Zabala, P.: A polyhedral approach for graph coloring. Electron. Notes Discrete Math. 7, 178\u2013181 (2001). https:\/\/doi.org\/10.1016\/S1571-0653(04)00254-9","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"2102_CR31","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10107-014-0812-y","volume":"150","author":"J Ostrowski","year":"2015","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1), 99\u2013129 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0812-y","journal-title":"Math. Program."},{"key":"2102_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-32147-4_6","volume-title":"Combinatorial Optimization","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Liberti, L.: Orbital shrinking. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) Combinatorial Optimization. Lecture Notes in Computer Science, vol. 7422, pp. 48\u201358. Springer, Athens (2012)"},{"issue":"1","key":"2102_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10107-011-0487-6","volume":"137","author":"R B\u00f6di","year":"2013","unstructured":"B\u00f6di, R., Herr, K., Joswig, M.: Algorithms for highly symmetric linear and integer programs. Math. Program. 137(1), 65\u201390 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0487-6","journal-title":"Math. Program."},{"key":"2102_CR34","unstructured":"Herr, K.: Core Sets and Symmetric Convex Optimization. PhD thesis, Technische Universit\u00e4t Darmstadt (2013)"},{"issue":"3","key":"2102_CR35","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.orl.2013.02.007","volume":"41","author":"K Herr","year":"2013","unstructured":"Herr, K., Rehn, T., Sch\u00fcrmann, A.: Exploiting symmetry in integer convex optimization using core points. Oper. Res. Lett. 41(3), 298\u2013304 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.02.007","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2102_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"key":"2102_CR37","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","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 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13, 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"2102_CR38","unstructured":"Junttila, T., Kaski, P.: bliss: A Tool for Computing Automorphism Groups and Canonical Labelings of Graphs. http:\/\/www.tcs.hut.fi\/Software\/bliss\/"},{"issue":"2\u20133","key":"2102_CR39","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-002-0316-z","volume":"94","author":"F Margot","year":"2003","unstructured":"Margot, F.: Small covering designs by branch-and-cut. Math. Program. 94(2\u20133), 207\u2013220 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0316-z","journal-title":"Math. Program."},{"issue":"6","key":"2102_CR40","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s10732-010-9150-2","volume":"17","author":"K Fadlaoui","year":"2011","unstructured":"Fadlaoui, K., Galinier, P.: A tabu search algorithm for the covering design problem. J. Heuristics 17(6), 659\u2013674 (2011). https:\/\/doi.org\/10.1007\/s10732-010-9150-2","journal-title":"J. Heuristics"},{"issue":"3","key":"2102_CR41","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/(SICI)1520-6610(1999)7:3<217::AID-JCD5>3.0.CO;2-W","volume":"7","author":"KJ Nurmela","year":"1999","unstructured":"Nurmela, K.J., \u00d6sterg\u00e5rd, P.R.J.: New coverings of $$t$$-sets with ($$t+1$$)-sets. J. Comb. Des. 7(3), 217\u2013226 (1999)","journal-title":"J. Comb. Des."},{"key":"2102_CR42","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-1927-3_9","volume-title":"The IMA Volumes in Mathematics and its Applications","author":"L Liberti","year":"2011","unstructured":"Liberti, L.: Symmetry in Mathematical Programming. In: The IMA Volumes in Mathematics and its Applications, pp. 263\u2013283. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_9"},{"key":"2102_CR43","doi-asserted-by":"crossref","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 der 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. Assoc. Comput. Mach. 49(2), (2023). https:\/\/doi.org\/10.1145\/3585516","DOI":"10.1145\/3585516"},{"issue":"1\u20132","key":"2102_CR44","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.dam.2012.07.020","volume":"161","author":"A Costa","year":"2013","unstructured":"Costa, A., Hansen, P., Liberti, L.: On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. Discrete Appl. Math. 161(1\u20132), 96\u2013161 (2013). https:\/\/doi.org\/10.1016\/j.dam.2012.07.020","journal-title":"Discrete Appl. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02102-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02102-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02102-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:02:51Z","timestamp":1750176171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02102-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,4]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2102"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02102-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,4]]},"assertion":[{"value":"20 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 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"}}]}}