{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T03:28:00Z","timestamp":1771471680732,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T00:00:00Z","timestamp":1640822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004937","name":"Bundesministerium f\u00fcr Forschung und Technologie","doi-asserted-by":"publisher","award":["05M14ZAM"],"award-info":[{"award-number":["05M14ZAM"]}],"id":[{"id":"10.13039\/501100004937","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Steiner tree problem in graphs (SPG) is one of the most studied problems in combinatorial optimization. In the past 10\u00a0years, there have been significant advances concerning approximation and complexity of the SPG. However, the state of the art in (practical) exact solution of the SPG has remained largely unchallenged for almost 20\u00a0years. While the DIMACS Challenge 2014 and the PACE Challenge 2018 brought renewed interest into Steiner tree problems, even the best new SPG solvers cannot match the state of the art on the vast majority of benchmark instances. The following article seeks to advance exact SPG solution once again. The article is based on a combination of three concepts: Implications, conflicts, and reductions. As a result, various new SPG techniques are conceived. Notably, several of the resulting techniques are (provably) stronger than well-known methods from the literature that are used in exact SPG algorithms. Finally, by integrating the new methods into a branch-and-cut framework, we obtain an exact SPG solver that is not only competitive with, but even outperforms the current state of the art on an extensive collection of benchmark sets. Furthermore, we can solve several instances for the first time to optimality.<\/jats:p>","DOI":"10.1007\/s10107-021-01757-5","type":"journal-article","created":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T15:02:11Z","timestamp":1640876531000},"page":"903-966","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Implications, conflicts, and reductions for Steiner trees"],"prefix":"10.1007","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2877-074X","authenticated-orcid":false,"given":"Daniel","family":"Rehfeldt","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,30]]},"reference":[{"issue":"1","key":"1757_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4\u201320 (2007). https:\/\/doi.org\/10.1016\/j.disopt.2006.10.006","journal-title":"Discrete Optim."},{"key":"1757_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"1757_CR3","doi-asserted-by":"publisher","unstructured":"de\u00a0Arag\u00e3o, M.P., Werneck, R.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Proceedings of the 4th International Workshop on Algorithm Engineering and Experiments, pp. 1\u201315. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-45643-0_1","DOI":"10.1007\/3-540-45643-0_1"},{"key":"1757_CR4","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Sikora, F.: The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: Paul, C., Pilipczuk, M. (eds.) 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, pp. 26:1\u201326:15. Schloss Dagstuhl\u2013Leibniz\u2013Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.26","DOI":"10.4230\/LIPIcs.IPEC.2018.26"},{"issue":"1","key":"1757_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6 (2013). https:\/\/doi.org\/10.1145\/2432622.2432628","journal-title":"J. ACM"},{"key":"1757_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23830-1_4","volume-title":"Steiner Trees in Industry","author":"X Cheng","year":"2004","unstructured":"Cheng, X., Du, D.Z.: Steiner Trees in Industry, vol. 11. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/0-387-23830-1_4"},{"key":"1757_CR7","unstructured":"DIMACS: 11th DIMACS Challenge. http:\/\/dimacs11.zib.de\/ (2015). Accessed 10 Jan 2020"},{"issue":"3","key":"1757_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971). https:\/\/doi.org\/10.1002\/net.3230010302","journal-title":"Networks"},{"key":"1757_CR9","unstructured":"Duin, C.: Steiner Problems in Graphs. Ph.D. thesis, University of Amsterdam (1993)"},{"key":"1757_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3171-2_10","volume-title":"Preprocessing the Steiner Problem in Graphs","author":"C Duin","year":"2000","unstructured":"Duin, C.: Preprocessing the Steiner Problem in Graphs. Springer US, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3171-2_10"},{"issue":"2","key":"1757_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0167-6377(89)90005-9","volume":"8","author":"C Duin","year":"1989","unstructured":"Duin, C., Volgenant, A.: An edge elimination test for the Steiner problem in graphs. Oper. Res. Lett. 8(2), 79\u201383 (1989). https:\/\/doi.org\/10.1016\/0167-6377(89)90005-9","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"1757_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1002\/net.3230190506","volume":"19","author":"CW Duin","year":"1989","unstructured":"Duin, C.W., Volgenant, A.: Reduction tests for the Steiner problem in graphs. Networks 19(5), 549\u2013567 (1989). https:\/\/doi.org\/10.1002\/net.3230190506","journal-title":"Networks"},{"issue":"2","key":"1757_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-016-0111-0","volume":"9","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Leitner, M., Ljubi\u0107, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203\u2013229 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0111-0","journal-title":"Math. Program. Comput."},{"issue":"2","key":"1757_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12532-016-0114-x","volume":"9","author":"G Gamrath","year":"2017","unstructured":"Gamrath, G., Koch, T., Maher, S., Rehfeldt, D., Shinano, Y.: SCIP-Jack\u2014a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2), 231\u2013296 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0114-x","journal-title":"Math. Program. Comput."},{"key":"1757_CR15","doi-asserted-by":"publisher","unstructured":"Goemans, M.X., Olver, N., Rothvo\u00df, T., Zenklusen, R.: Matroids and integrality gaps for hypergraphic Steiner tree relaxations. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, STOC \u201912, pp. 1161\u20131176. Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2213977.2214081","DOI":"10.1145\/2213977.2214081"},{"key":"1757_CR16","unstructured":"Hegde, C., Indyk, P., Schmidt, L.: A fast, adaptive variant of the Goemans\u2013Williamson scheme for the prize-collecting Steiner tree problem. In: Workshop of the 11th DIMACS Implementation Challenge. Workshop of the 11th DIMACS Implementation Challenge (2014)"},{"issue":"2","key":"1757_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12532-016-0110-1","volume":"9","author":"S Hougardy","year":"2017","unstructured":"Hougardy, S., Silvanus, J., Vygen, J.: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. Math. Program. Comput. 9(2), 135\u2013202 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0110-1","journal-title":"Math. Program. Comput."},{"key":"1757_CR18","unstructured":"Hu\u0161ek, R., Knop, D., Masa\u0159\u00edk, T.: Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. arXiv preprint arXiv:2002.03583 (2020)"},{"key":"1757_CR19","volume-title":"The Steiner Tree Problem. Annals of Discrete Mathematics","author":"F Hwang","year":"1992","unstructured":"Hwang, F., Richards, D., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics. Elsevier Science, Amsterdam (1992)"},{"key":"1757_CR20","unstructured":"IBM: Cplex. https:\/\/www.ibm.com\/analytics\/cplex-optimizer (2020)"},{"key":"1757_CR21","doi-asserted-by":"publisher","unstructured":"Iwata, Y., Shigemura, T.: Separator-based pruned dynamic programming for Steiner tree. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a033, pp. 1520\u20131527 (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33011520","DOI":"10.1609\/aaai.v33i01.33011520"},{"issue":"4","key":"1757_CR22","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s12532-018-0135-8","volume":"10","author":"D Juhl","year":"2018","unstructured":"Juhl, D., Warme, D.M., Winter, P., Zachariasen, M.: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. Math. Program. Comput. 10(4), 487\u2013532 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0135-8","journal-title":"Math. Program. Comput."},{"key":"1757_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"1757_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3371389","volume":"16","author":"S Kisfaludi-Bak","year":"2020","unstructured":"Kisfaludi-Bak, S., Nederlof, J., Leeuwen, E.J.V.: Nearly ETH-tight algorithms for planar Steiner tree with terminals on few faces. ACM Trans. Algorithms (TALG) 16(3), 1\u201330 (2020). https:\/\/doi.org\/10.1145\/3371389","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"1757_CR25","doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207\u2013232 (1998). https:\/\/doi.org\/10.1002\/(SICI)1097-0037(199810)32:3%3C207::AID-NET5%3E3.0.CO;2-O","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O"},{"key":"1757_CR26","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner Trees in Industries","author":"T Koch","year":"2001","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on Steiner tree problems in graphs. In: Du, D.Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 285\u2013325. Kluwer, Alphen aan den Rijn (2001)"},{"key":"1757_CR27","unstructured":"Leitner, M., Ljubic, I., Luipersbeck, M., Prossegger, M., Resch, M.: New Real-World Instances for the Steiner Tree Problem in Graphs. Tech. rep, ISOR, Uni Wien (2014)"},{"issue":"2","key":"1757_CR28","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1137\/19M1249825","volume":"30","author":"B M\u00fcller","year":"2020","unstructured":"M\u00fcller, B., Serrano, F., Gleixner, A.: Using two-dimensional projections for stronger separation and propagation of bilinear terms. SIAM J. Optim. 30(2), 1339\u20131365 (2020). https:\/\/doi.org\/10.1137\/19M1249825","journal-title":"SIAM J. Optim."},{"key":"1757_CR29","doi-asserted-by":"publisher","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using M\u00f6bius inversion: improving on Steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) International Colloquium on Automata, Languages, and Programming, pp. 713\u2013725. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_59","DOI":"10.1007\/978-3-642-02927-1_59"},{"key":"1757_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-017-0123-4","author":"T Pajor","year":"2017","unstructured":"Pajor, T., Uchoa, E., Werneck, R.F.: A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. (2017). https:\/\/doi.org\/10.1007\/s12532-017-0123-4","journal-title":"Math. Program. Comput."},{"key":"1757_CR31","unstructured":"Polzin, T.: Algorithms for the Steiner Problem in Networks. Ph.D. thesis, Saarland University (2003)"},{"issue":"1\u20133","key":"1757_CR32","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/s0166-218x(00)00318-8","volume":"112","author":"T Polzin","year":"2001","unstructured":"Polzin, T., Daneshmand, S.V.: A comparison of Steiner tree relaxations. Discrete Appl. Math. 112(1\u20133), 241\u2013261 (2001). https:\/\/doi.org\/10.1016\/s0166-218x(00)00318-8","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"1757_CR33","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T Polzin","year":"2001","unstructured":"Polzin, T., Daneshmand, S.V.: Improved algorithms for the Steiner problem in networks. Discrete Appl. Math. 112(1\u20133), 263\u2013300 (2001). https:\/\/doi.org\/10.1016\/S0166-218X(00)00319-X","journal-title":"Discrete Appl. Math."},{"key":"1757_CR34","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/3-540-45749-6_69","volume-title":"Extending Reduction Techniques for the Steiner Tree Problem","author":"T Polzin","year":"2002","unstructured":"Polzin, T., Daneshmand, S.V.: Extending Reduction Techniques for the Steiner Tree Problem, pp. 795\u2013807. Springer, Berlin (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_69"},{"issue":"1","key":"1757_CR35","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0167-6377(02)00185-2","volume":"31","author":"T Polzin","year":"2003","unstructured":"Polzin, T., Daneshmand, S.V.: On Steiner trees and minimum spanning trees in hypergraphs. Oper. Res. Lett. 31(1), 12\u201320 (2003). https:\/\/doi.org\/10.1016\/S0167-6377(02)00185-2","journal-title":"Oper. Res. Lett."},{"key":"1757_CR36","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11764298_22","volume-title":"Experimental Algorithms","author":"T Polzin","year":"2006","unstructured":"Polzin, T., Daneshmand, S.V.: Practical partitioning-based methods for the Steiner problem. In: \u00c0lvarez, C.., Serna, M.. (eds.) Experimental Algorithms, pp. 247\u2013252. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11764298_22"},{"key":"1757_CR37","unstructured":"Polzin, T., Vahdati-Daneshmand, S.: The Steiner Tree Challenge: An updated Study (2014). Unpublished manuscript at http:\/\/dimacs11.cs.princeton.edu\/downloads.html"},{"key":"1757_CR38","unstructured":"Rehfeldt, D., Koch, T.: Implications, conflicts, and reductions for Steiner trees. Tech. Rep. 20-28, ZIB, Takustr. 7, 14195 Berlin (2020)"},{"key":"1757_CR39","unstructured":"Rehfeldt, D., Koch, T.: On the exact solution of prize-collecting Steiner tree problems. Tech. Rep. 20-11, ZIB, Takustr. 7, 14195 Berlin (2020)"},{"issue":"4","key":"1757_CR40","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"key":"1757_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4137-7_28","volume-title":"New Benchmark Instances for The Steiner Problem in Graphs","author":"I Rosseti","year":"2004","unstructured":"Rosseti, I., de Arag\u00e3o, M.P., Ribeiro, C.C., Uchoa, E., Werneck, R.F.: New Benchmark Instances for The Steiner Problem in Graphs. Springer US, Boston (2004). https:\/\/doi.org\/10.1007\/978-1-4757-4137-7_28"},{"issue":"4","key":"1757_CR42","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4), 445\u2013454 (1994). https:\/\/doi.org\/10.1287\/ijoc.6.4.445","journal-title":"ORSA J. Comput."},{"key":"1757_CR43","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Mathematica Japonicae 24, 573\u2013577 (1980)","journal-title":"Mathematica Japonicae"},{"issue":"4","key":"1757_CR44","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.orl.2005.02.007","volume":"34","author":"E Uchoa","year":"2006","unstructured":"Uchoa, E.: Reduction tests for the prize-collecting Steiner problem. Oper. Res. Lett. 34(4), 437\u2013444 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.02.007","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1757_CR45","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/net.10035","volume":"40","author":"E Uchoa","year":"2002","unstructured":"Uchoa, E., Poggi de Arag\u00e3o, M., Ribeiro, C.C.: Preprocessing Steiner problems from VLSI layout. Networks 40(1), 38\u201350 (2002). https:\/\/doi.org\/10.1002\/net.10035","journal-title":"Networks"},{"key":"1757_CR46","unstructured":"Vahdati\u00a0Daneshmand, S.: Algorithmic Approaches to the Steiner Problem in Networks. Ph.D. thesis, Universit\u00e4t Mannheim (2004)"},{"issue":"21","key":"1757_CR47","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1016\/j.ipl.2011.08.005","volume":"111","author":"J Vygen","year":"2011","unstructured":"Vygen, J.: Faster algorithm for optimum Steiner trees. Inf. Process. Lett. 111(21), 1075\u20131079 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2011.08.005","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"1757_CR48","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/net.3230260404","volume":"26","author":"P Winter","year":"1995","unstructured":"Winter, P.: Reductions for the rectilinear Steiner tree problem. Networks 26(4), 187\u2013198 (1995). https:\/\/doi.org\/10.1002\/net.3230260404","journal-title":"Networks"},{"key":"1757_CR49","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.0973","author":"J Witzig","year":"2020","unstructured":"Witzig, J., Gleixner, A.: Conflict-driven heuristics for mixed integer programming. INFORMS J. Comput. (2020). https:\/\/doi.org\/10.1287\/ijoc.2020.0973. (Epub ahead of print)","journal-title":"INFORMS J. Comput."},{"key":"1757_CR50","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R Wong","year":"1984","unstructured":"Wong, R.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Program. 28, 271\u2013287 (1984). https:\/\/doi.org\/10.1007\/BF02612335","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01757-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01757-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01757-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:16:55Z","timestamp":1675703815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01757-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,30]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1757"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01757-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,30]]},"assertion":[{"value":"26 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}