{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:50Z","timestamp":1772614490597,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T00:00:00Z","timestamp":1588204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T00:00:00Z","timestamp":1588204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["1818700"],"award-info":[{"award-number":["1818700"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10107-020-01508-y","type":"journal-article","created":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T16:45:56Z","timestamp":1588265156000},"page":"193-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Strong formulations for conic quadratic optimization with indicator variables"],"prefix":"10.1007","volume":"188","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3668-0653","authenticated-orcid":false,"given":"Andr\u00e9s","family":"G\u00f3mez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"1508_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":"1508_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, K., Jensen, A.N.: Intersection cuts for mixed integer conic quadratic sets. In: International Conference on Integer Programming and Combinatorial Optimization, pp 37\u201348. Springer (2013)","DOI":"10.1007\/978-3-642-36694-9_4"},{"key":"1508_CR3","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1287\/opre.2016.1570","volume":"65","author":"A Atamt\u00fcrk","year":"2017","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Maximizing a class of utility functions over the vertices of a polytope. Oper. Res. 65, 433\u2013445 (2017)","journal-title":"Oper. Res."},{"key":"1508_CR4","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":"1508_CR5","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Rank-one convexification for sparse regression. arXiv preprint arXiv:1901.10334 (2019)"},{"issue":"2","key":"1508_CR6","first-page":"609","volume":"68","author":"A Atamt\u00fcrk","year":"2020","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Submodularity in conic quadratic mixed 0\u20131 optimization. Oper. Res. 68(2), 609\u2013630 (2020)","journal-title":"Oper. Res."},{"key":"1508_CR7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/s10898-018-00736-z","volume":"73","author":"A Atamt\u00fcrk","year":"2019","unstructured":"Atamt\u00fcrk, A., Jeon, H.: Lifted polymatroid inequalities for mean-risk optimization with indicator variables. J. Global Optim. 73, 677\u2013699 (2019)","journal-title":"J. Global Optim."},{"key":"1508_CR8","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.orl.2008.04.006","volume":"36","author":"A Atamt\u00fcrk","year":"2008","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Polymatroids and mean-risk minimization in discrete optimization. Oper. Res. Lett. 36, 618\u2013622 (2008)","journal-title":"Oper. Res. Lett."},{"key":"1508_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0239-4","volume":"122","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Math. Program. 122, 1\u201320 (2010)","journal-title":"Math. Program."},{"key":"1508_CR10","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-009-0282-9","volume":"126","author":"A Atamt\u00fcrk","year":"2011","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Lifting for conic mixed-integer programming. Math. Program. 126, 351\u2013363 (2011)","journal-title":"Math. Program."},{"key":"1508_CR11","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/opre.1110.1037","volume":"60","author":"A Atamt\u00fcrk","year":"2012","unstructured":"Atamt\u00fcrk, A., Berenguer, G., Shen, Z.J.: A conic integer programming approach to stochastic joint location-inventory problems. Oper. Res. 60, 366\u2013381 (2012)","journal-title":"Oper. Res."},{"key":"1508_CR12","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: Convexification of l0 formulations. arXiv preprint arXiv:1811.02655 BCOL Research Report 18.05, IEOR, UC Berkeley (2018)"},{"key":"1508_CR13","doi-asserted-by":"crossref","first-page":"2778","DOI":"10.1016\/j.dam.2013.05.017","volume":"161","author":"P Belotti","year":"2013","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: On families of quadratic surfaces having fixed intersections with two hyperplanes. Discrete Appl. Math. 161, 2778\u20132793 (2013)","journal-title":"Discrete Appl. Math."},{"key":"1508_CR14","doi-asserted-by":"crossref","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization. In: Numerical Analysis and Optimization, pp. 1\u201335. Springer (2015)","DOI":"10.1007\/978-3-319-17689-5_1"},{"key":"1508_CR15","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: Disjunctive conic cuts for mixed integer second order cone optimization. GERAD-HEC Montr\u00e9al (2015)"},{"key":"1508_CR16","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"key":"1508_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"key":"1508_CR18","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/120878963","volume":"24","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Michalka, A.: Cutting-planes for optimization of convex functions over nonconvex sets. SIAM J. Optim. 24, 643\u2013677 (2014)","journal-title":"SIAM J. Optim."},{"key":"1508_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (2011)"},{"key":"1508_CR20","doi-asserted-by":"crossref","unstructured":"Bonami, P.: Lift-and-project cuts for mixed integer convex programs. In: International Conference on Integer Programming and Combinatorial Optimization, pp 52\u201364. Springer (2011)","DOI":"10.1007\/978-3-642-20807-2_5"},{"key":"1508_CR21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151, 191\u2013223 (2015)","journal-title":"Math. Program."},{"key":"1508_CR22","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":"1508_CR23","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"MT \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M.T., Iyengar, G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104, 179\u2013202 (2005)","journal-title":"Math. Program."},{"key":"1508_CR24","doi-asserted-by":"crossref","unstructured":"Dong, H., Linderoth, J.: On valid inequalities for quadratic programming with continuous variables and binary indicators. In: Goemans, M., Correa, J. (eds.) Proc. IPCO 2013, pp 169\u2013180. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_15"},{"key":"1508_CR25","unstructured":"Dong, H., Chen, K., Linderoth, J.: Regularization vs. relaxation: a conic optimization perspective of statistical variable selection. arXiv preprint arXiv:1510.06083 (2015)"},{"key":"1508_CR26","first-page":"69","volume-title":"Combinatorial Structures and Their Applications","author":"J Edmonds","year":"1970","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., Sch\u00f6nenheim, J. (eds.) Combinatorial Structures and Their Applications, pp. 69\u201387. Gordon and Breach, New York (1970)"},{"key":"1508_CR27","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18, 1035\u20131064 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1508_CR28","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.51.4.543.16101","volume":"51","author":"L El Ghaoui","year":"2003","unstructured":"El Ghaoui, L., Oks, M., Oustry, F.: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach. Oper. Res. 51, 543\u2013556 (2003)","journal-title":"Oper. Res."},{"key":"1508_CR29","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."},{"key":"1508_CR30","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.orl.2006.03.008","volume":"35","author":"A Frangioni","year":"2007","unstructured":"Frangioni, A., Gentile, C.: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP. Oper. Res. Lett. 35, 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"key":"1508_CR31","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.orl.2009.02.003","volume":"37","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C.: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. Oper. Res. Lett. 37, 206\u2013210 (2009)","journal-title":"Oper. Res. Lett."},{"key":"1508_CR32","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1007\/s10589-015-9787-8","volume":"63","author":"A Frangioni","year":"2016","unstructured":"Frangioni, A., Furini, F., Gentile, C.: Approximated perspective relaxations: a project and lift approach. Comput. Optim. Appl. 63, 705\u2013735 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1508_CR33","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."},{"issue":"1","key":"1508_CR34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/moor.2018.0969","volume":"45","author":"A Frangioni","year":"2019","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 (2019)","journal-title":"Math. Oper. Res."},{"key":"1508_CR35","unstructured":"G\u00f3mez, A., Prokopyev, O.: A mixed-integer fractional optimization approach to best subset selection. http:\/\/www.optimization-online.org\/DB_HTML\/2018\/08\/6791.html (2018). Accessed 15 Apr 2020"},{"key":"1508_CR36","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":"1508_CR37","unstructured":"Han, G., Shaoning, Andr\u00e9s, Atamt\u00fcrk, A.: 2x2-convexifications for convex quadratic optimization with indicator variables. http:\/\/www.optimization-online.org\/DB_HTML\/2020\/04\/7746.html (2020). Accessed 15 Apr 2020"},{"key":"1508_CR38","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints. Comput. Optim. Appl. 52, 537\u2013558 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1508_CR39","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\u2013off constraints. Discrete Optim. 24, 32\u201350 (2017)","journal-title":"Discrete Optim."},{"key":"1508_CR40","unstructured":"K\u0131l\u0131n\u00e7, M., Linderoth, J., Luedtke, J.: Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Optimization Online (2010)"},{"issue":"2","key":"1508_CR41","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/moor.2015.0737","volume":"41","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F.: On minimal valid inequalities for mixed integer conic programs. Math. Oper. Res. 41(2), 477\u2013510 (2015)","journal-title":"Math. Oper. Res."},{"key":"1508_CR42","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10107-015-0903-4","volume":"154","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. Math. Program. 154, 463\u2013491 (2015)","journal-title":"Math. Program."},{"key":"1508_CR43","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming the State of the Art: Bonn 1982","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Gr\u00f6tschel, M. (eds.) Mathematical Programming the State of the Art: Bonn 1982, pp. 235\u2013257. Springer, Berlin (1983)"},{"key":"1508_CR44","unstructured":"Mahajan, A., Leyffer, S., Linderoth, J., Luedtke, J., Munson, T.: Minotaur: a mixed-integer nonlinear optimization toolkit. ANL\/MCS-P8010-0817, Argonne National Lab (2017)"},{"key":"1508_CR45","unstructured":"Mazumder, R., Radchenko, P., Dedieu, A.: Subset selection with shrinkage: sparse linear modeling when the SNR is low. arXiv preprint arXiv:1708.03288 (2017)"},{"key":"1508_CR46","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.ejor.2015.06.081","volume":"247","author":"R Miyashiro","year":"2015","unstructured":"Miyashiro, R., Takano, Y.: Mixed integer second-order cone programming formulations for variable selection in linear regression. Eur. J. Oper. Res. 247, 721\u2013731 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1508_CR47","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.orl.2014.10.006","volume":"43","author":"S Modaresi","year":"2015","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Split cuts and extended formulations for mixed integer conic quadratic programming. Oper. Res. Lett. 43(1), 10\u201315 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1508_CR48","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10107-015-0866-5","volume":"155","author":"S Modaresi","year":"2016","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155, 575\u2013611 (2016)","journal-title":"Math. Program."},{"key":"1508_CR49","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/110840868","volume":"22","author":"RDA Mor\u00e1n","year":"2012","unstructured":"Mor\u00e1n, R.D.A., Dey, S.S., Vielma, J.P.: A strong dual for conic mixed-integer programs. SIAM J. Optim. 22, 1136\u20131150 (2012)","journal-title":"SIAM J. Optim."},{"key":"1508_CR50","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/nav.20282","volume":"55","author":"L Ozsen","year":"2008","unstructured":"Ozsen, L., Coullard, C.R., Daskin, M.S.: Capacitated warehouse location model with risk pooling. Nav. Res. Logist. (NRL) 55, 295\u2013312 (2008)","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"1508_CR51","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10107-008-0226-9","volume":"121","author":"JPP 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."},{"key":"1508_CR52","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.disopt.2016.11.001","volume":"24","author":"A Santana","year":"2017","unstructured":"Santana, A., Dey, S.S.: Some cut-generating functions for second-order conic sets. Discrete Optim. 24, 51\u201365 (2017)","journal-title":"Discrete Optim."},{"key":"1508_CR53","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"1508_CR54","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1137\/15M1012232","volume":"27","author":"B Wu","year":"2017","unstructured":"Wu, B., Sun, X., Li, D., Zheng, X.: Quadratic convex reformulations for semicontinuous quadratic programming. SIAM J. Optim. 27, 1531\u20131553 (2017)","journal-title":"SIAM J. Optim."},{"key":"1508_CR55","doi-asserted-by":"crossref","unstructured":"Xie, W., Deng, X.: Scalable algorithms for sparse ridge regression. arXiv preprint arXiv:1806.03756 (2020)","DOI":"10.1137\/19M1245414"},{"issue":"4","key":"1508_CR56","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/j.orl.2015.06.001","volume":"43","author":"S Y\u0131ld\u0131z","year":"2015","unstructured":"Y\u0131ld\u0131z, S., Cornu\u00e9jols, G.: Disjunctive cuts for cross-sections of the second-order cone. Oper. Res. Lett. 43(4), 432\u2013437 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1508_CR57","unstructured":"Zhang, Y., Jiang, R., Shen, S.: Ambiguous chance-constrained bin packing under mean-covariance information. arXiv preprint arXiv:1610.00035 (2016)"},{"key":"1508_CR58","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/ijoc.2014.0592","volume":"26","author":"X Zheng","year":"2014","unstructured":"Zheng, X., Sun, X., Li, D.: Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach. INFORMS J. Comput. 26, 690\u2013703 (2014)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01508-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01508-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01508-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T15:54:54Z","timestamp":1624377294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01508-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,30]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1508"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01508-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,30]]},"assertion":[{"value":"9 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}