{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T04:21:26Z","timestamp":1727497286599},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2006762","2007814"],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N00014-22-1-2127"],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2152776"],"id":[{"id":"10.13039\/100000121","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,7]]},"DOI":"10.1007\/s10107-022-01845-0","type":"journal-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T15:03:13Z","timestamp":1655823793000},"page":"669-701","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A graph-based decomposition method for convex quadratic optimization with indicators"],"prefix":"10.1007","volume":"200","author":[{"given":"Peijing","family":"Liu","sequence":"first","affiliation":[]},{"given":"Salar","family":"Fattahi","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3668-0653","authenticated-orcid":false,"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6548-9378","authenticated-orcid":false,"given":"Simge","family":"K\u00fc\u00e7\u00fckyavuz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"1845_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"MS Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M.S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37, 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"key":"1845_CR2","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s10107-021-01671-w","volume":"188","author":"KM Anstreicher","year":"2021","unstructured":"Anstreicher, K.M., Burer, S.: Quadratic optimization with switching variables: The convex hull for $$n= 2$$. Math. Program. 188, 421\u2013441 (2021)","journal-title":"Math. Program."},{"key":"1845_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with M-matrices and indicator variables. Math. Program. 170, 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"1845_CR4","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Rank-one convexification for sparse regression. arXiv preprint arXiv:1901.10334 (2019)"},{"key":"1845_CR5","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Safe screening rules for L0-regression from perspective relaxations. In International Conference on Machine Learning, pages 421\u2013430. PMLR, (2020)"},{"key":"1845_CR6","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Supermodularity and valid inequalities for quadratic optimization with indicators. arXiv preprint arXiv:2012.14633, (2020)"},{"issue":"52","key":"1845_CR7","first-page":"1","volume":"22","author":"A Atamt\u00fcrk","year":"2021","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: Convexification of L0-formulations. J. Mach. Learn. Res. 22(52), 1\u201343 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1845_CR8","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1016\/S1474-6670(17)66057-9","volume":"11","author":"DP Bertsekas","year":"1978","unstructured":"Bertsekas, D.P.: Local convex conjugacy and Fenchel duality. IFAC Proceedings Volumes 11(1), 1079\u20131084 (1978)","journal-title":"IFAC Proceedings Volumes"},{"key":"1845_CR9","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44, 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"issue":"2","key":"1845_CR10","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1111\/j.2517-6161.1974.tb00999.x","volume":"36","author":"J Besag","year":"1974","unstructured":"Besag, J.: Spatial interaction and the statistical analysis of lattice systems. J. Roy. Stat. Soc.: Ser. B (Methodol.) 36(2), 192\u2013225 (1974)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"issue":"4","key":"1845_CR11","first-page":"733","volume":"82","author":"J Besag","year":"1995","unstructured":"Besag, J., Kooperberg, C.: On conditional and intrinsic autoregressions. Biometrika 82(4), 733\u2013746 (1995)","journal-title":"Biometrika"},{"issue":"1","key":"1845_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00116466","volume":"43","author":"J Besag","year":"1991","unstructured":"Besag, J., York, J., Molli\u00e9, A.: Bayesian image restoration, with two applications in spatial statistics. Ann. Inst. Stat. Math. 43(1), 1\u201320 (1991)","journal-title":"Ann. Inst. Stat. Math."},{"issue":"2","key":"1845_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02592208","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74(2), 121\u2013140 (1996)","journal-title":"Math. Program."},{"key":"1845_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"key":"1845_CR15","unstructured":"Boyd, S., Xiao, L., Mutapcic, A.: Subgradient methods. Lecture notes of EE392o, Stanford University, Autumn Quarter, 2004:2004\u20132005, (2003)"},{"key":"1845_CR16","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"1845_CR17","unstructured":"Chen, Y., Ge, D., Wang, M., Wang, Z., Ye, Y., Yin, H.: Strong np-hardness for sparse optimization with concave penalty functions. In International Conference on Machine Learning, pages 740\u2013747. PMLR (2017)"},{"issue":"6","key":"1845_CR18","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1002\/aic.14418","volume":"60","author":"A Cozad","year":"2014","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: Learning surrogate models for simulation-based optimization. AIChE J. 60(6), 2211\u20132227 (2014)","journal-title":"AIChE J."},{"key":"1845_CR19","doi-asserted-by":"crossref","unstructured":"Das, A., Kempe, D.: Algorithms for subset selection in linear regression. In Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pages 45\u201354, (2008)","DOI":"10.1145\/1374376.1374384"},{"key":"1845_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717655","volume-title":"Numerical linear algebra and applications","author":"BN Datta","year":"2010","unstructured":"Datta, B.N.: Numerical linear algebra and applications, vol. 116. SIAM, Philadelphia (2010)"},{"issue":"1","key":"1845_CR21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10107-020-01475-4","volume":"187","author":"D Davarnia","year":"2021","unstructured":"Davarnia, D., Van Hoeve, W.-J.: Outer approximation for integer nonlinear programs via decision diagrams. Math. Program. 187(1), 111\u2013150 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"1845_CR22","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1137\/18M1219266","volume":"30","author":"A Del Pia","year":"2020","unstructured":"Del Pia, A., Dey, S.S., Weismantel, R.: Subset selection in sparse matrices. SIAM J. Optim. 30(2), 1173\u20131190 (2020)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1845_CR23","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"G Eppen","year":"1987","unstructured":"Eppen, G., Martin, R.: Solving multi-item capacitated lot-sizing problems with variable definition. Oper. Res. 35(6), 832\u2013848 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"1845_CR24","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-018-1331-z","volume":"176","author":"EX Fang","year":"2019","unstructured":"Fang, E.X., Liu, H., Wang, M.: Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach. Math. Program. 176(1), 175\u2013205 (2019)","journal-title":"Math. Program."},{"key":"1845_CR25","unstructured":"Fattahi, S., G\u00f3mez, A.: Scalable inference of sparsely-changing Markov random fields with strong statistical guarantees. Forthcoming in NeurIPS, (2021)"},{"key":"1845_CR26","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.orl.2017.08.001","volume":"45","author":"A Frangioni","year":"2017","unstructured":"Frangioni, A., Furini, F., Gentile, C.: Improving the approximated projected perspective reformulation by dual information. Oper. Res. Lett. 45, 519\u2013524 (2017)","journal-title":"Oper. Res. Lett."},{"key":"1845_CR27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0\u20131 mixed integer programs. Math. Program. 106, 225\u2013236 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"1845_CR28","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/moor.2018.0969","volume":"45","author":"A Frangioni","year":"2020","unstructured":"Frangioni, A., Gentile, C., Hungerford, J.: Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs. Math. Oper. Res. 45(1), 15\u201333 (2020)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1845_CR29","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/nav.21519","volume":"60","author":"D Gade","year":"2013","unstructured":"Gade, D., K\u00fc\u00e7\u00fckyavuz, S.: Formulations for dynamic lot sizing with service levels. Nav. Res. Logist. 60(2), 87\u2013101 (2013)","journal-title":"Nav. Res. Logist."},{"volume-title":"Computers and intractability","year":"1979","author":"MR Garey","key":"1845_CR30","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. freeman, San Francisco (1979)"},{"key":"1845_CR31","unstructured":"Geman, S., Graffigne, C.: Markov random field image models and their applications to computer vision. In: Proceedings of the International Congress of Mathematicians, vol. 1, page\u00a02. Berkeley, CA, (1986)"},{"issue":"3","key":"1845_CR32","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1137\/19M1306233","volume":"31","author":"A G\u00f3mez","year":"2021","unstructured":"G\u00f3mez, A.: Outlier detection in time series via mixed-integer conic quadratic optimization. SIAM J. Optim. 31(3), 1897\u20131925 (2021)","journal-title":"SIAM J. Optim."},{"key":"1845_CR33","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"1845_CR34","unstructured":"Han, S., G\u00f3mez, A., Atamt\u00fcrk, A.: 2x2 convexifications for convex quadratic optimization with indicator variables. arXiv preprint arXiv:2004.07448, (2020)"},{"key":"1845_CR35","doi-asserted-by":"publisher","unstructured":"Hazimeh, H., Mazumder, R., Saab, A.: Sparse regression at scale: Branch-and-bound rooted in first-order optimization. Mathematical Programming, 2021. Article in Advance, https:\/\/doi.org\/10.1007\/s10107-021-01712-4","DOI":"10.1007\/s10107-021-01712-4"},{"key":"1845_CR36","unstructured":"He, Z., Han, S., G\u00f3mez, A., Cui, Y., Pang, J.-S.: Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. Optimization Online: http:\/\/www.optimization-online.org\/DB_HTML\/2021\/09\/8608.html, (2021)"},{"issue":"4","key":"1845_CR37","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1145\/502090.502093","volume":"48","author":"DS Hochbaum","year":"2001","unstructured":"Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. Journal of the ACM (JACM) 48(4), 686\u2013701 (2001)","journal-title":"Journal of the ACM (JACM)"},{"key":"1845_CR38","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disopt.2016.04.008","volume":"24","author":"H Jeon","year":"2017","unstructured":"Jeon, H., Linderoth, J., Miller, A.: Quadratic cone cutting surfaces for quadratic programs with on-off constraints. Discret. Optim. 24, 32\u201350 (2017)","journal-title":"Discret. Optim."},{"issue":"1","key":"1845_CR39","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48\u201350 (1956)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"1845_CR40","unstructured":"K\u00fc\u00e7\u00fckyavuz, S., Shojaie, A., Manzour, H., Wei, L.: Consistent second-order conic integer programming for learning Bayesian networks. arXiv preprint arXiv:2005.14346, (2020)"},{"issue":"6","key":"1845_CR41","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1287\/opre.2020.1979","volume":"68","author":"L Lozano","year":"2020","unstructured":"Lozano, L., Bergman, D., Smith, J.C.: On the consistent path problem. Operations Resesarch 68(6), 1913\u20131931 (2020)","journal-title":"Operations Resesarch"},{"key":"1845_CR42","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","volume":"7","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. Handbooks Oper. Res. Management Sci. 7, 503\u2013615 (1995)","journal-title":"Handbooks Oper. Res. Management Sci."},{"issue":"1","key":"1845_CR43","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1287\/ijoo.2019.0040","volume":"3","author":"H Manzour","year":"2021","unstructured":"Manzour, H., K\u00fc\u00e7\u00fckyavuz, S., Wu, H.-H., Shojaie, A.: Integer programming for learning directed acyclic graphs from continuous data. INFORMS Journal on Optimization 3(1), 46\u201373 (2021)","journal-title":"INFORMS Journal on Optimization"},{"issue":"23","key":"1845_CR44","doi-asserted-by":"crossref","first-page":"6281","DOI":"10.1109\/TSP.2018.2875886","volume":"66","author":"X Mao","year":"2018","unstructured":"Mao, X., Qiu, K., Li, T., Gu, Y.: Spatio-temporal signal recovery based on low rank and differential smoothness. IEEE Trans. Signal Process. 66(23), 6281\u20136296 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1845_CR45","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120(1), 221\u2013259 (2009)","journal-title":"Math. Program."},{"key":"1845_CR46","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^2)$$. In Doklady Akademii Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"In Doklady Akademii Nauk SSSR"},{"key":"1845_CR47","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10107-008-0226-9","volume":"121","author":"J-PP Richard","year":"2010","unstructured":"Richard, J.-P.P., Tawarmalani, M.: Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Math. Program. 121, 61\u2013104 (2010)","journal-title":"Math. Program."},{"issue":"7","key":"1845_CR48","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/83.701163","volume":"7","author":"SS Saquib","year":"1998","unstructured":"Saquib, S.S., Bouman, C.A., Sauer, K.: ML parameter estimation for Markov random fields with applications to Bayesian tomography. IEEE Trans. Image Process. 7(7), 1029\u20131044 (1998)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"1845_CR49","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pac. J. Math. 8(1), 171\u2013176 (1958)","journal-title":"Pac. J. Math."},{"key":"1845_CR50","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Can. J. Math. 6, 347\u2013352 (1954)","journal-title":"Can. J. Math."},{"issue":"1\u20132","key":"1845_CR51","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-021-01734-y","volume":"192","author":"L Wei","year":"2022","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: Ideal formulations for constrained convex optimization problems with indicator variables. Mathematical Programmming 192(1\u20132), 57\u201388 (2022)","journal-title":"Mathematical Programmming"},{"key":"1845_CR52","doi-asserted-by":"crossref","unstructured":"Wei, L., G\u00f3mez, A., K\u00fc\u00e7\u00fckyavuz, S.: On the convexification of constrained quadratic optimization problems with indicator variables. In International Conference on Integer Programming and Combinatorial Optimization, pages 433\u2013447. Springer, (2020)","DOI":"10.1007\/978-3-030-45771-6_33"},{"key":"1845_CR53","doi-asserted-by":"crossref","unstructured":"Wolsey, L.A.: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. 48(12), 1587\u20131602, (2002)","DOI":"10.1287\/mnsc.48.12.1587.442"},{"key":"1845_CR54","doi-asserted-by":"crossref","DOI":"10.1002\/9781119606475","volume-title":"Integer programming","author":"LA Wolsey","year":"2020","unstructured":"Wolsey, L.A.: Integer programming. John Wiley & Sons, Newyork (2020)"},{"volume-title":"Integer and combinatorial optimization","year":"1999","author":"LA Wolsey","key":"1845_CR55","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and combinatorial optimization. John Wiley & Sons, Newyork (1999)"},{"issue":"1","key":"1845_CR56","doi-asserted-by":"crossref","first-page":"1665","DOI":"10.1016\/j.procs.2010.04.186","volume":"1","author":"H Wu","year":"2010","unstructured":"Wu, H., No\u00e9, F.: Maximum a posteriori estimation for Markov chains based on gaussian Markov random fields. Procedia Computer Science 1(1), 1665\u20131673 (2010)","journal-title":"Procedia Computer Science"},{"key":"1845_CR57","doi-asserted-by":"crossref","first-page":"3359","DOI":"10.1137\/19M1245414","volume":"30","author":"W Xie","year":"2020","unstructured":"Xie, W., Deng, X.: Scalable algorithms for the sparse ridge regression. SIAM J. Optim. 30, 3359\u20133386 (2020)","journal-title":"SIAM J. Optim."},{"key":"1845_CR58","doi-asserted-by":"crossref","unstructured":"Ziniel, J., Potter, L.C., Schniter, P.: Tracking and smoothing of time-varying sparse signals via approximate belief propagation. In: 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers, pages 808\u2013812. IEEE, (2010)","DOI":"10.1109\/ACSSC.2010.5757677"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01845-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01845-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01845-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T10:08:32Z","timestamp":1727431712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01845-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,21]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1845"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01845-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,6,21]]},"assertion":[{"value":"4 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}