{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T10:09:10Z","timestamp":1782814150575,"version":"3.54.5"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T00:00:00Z","timestamp":1667433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T00:00:00Z","timestamp":1667433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005017","name":"Bayerisches Staatsministerium f\u00fcr Wirtschaft, Infrastruktur, Verkehr und Technologie","doi-asserted-by":"publisher","award":["ADA-Center"],"award-info":[{"award-number":["ADA-Center"]}],"id":[{"id":"10.13039\/501100005017","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005017","name":"Bayerisches Staatsministerium f\u00fcr Wirtschaft, Infrastruktur, Verkehr und Technologie","doi-asserted-by":"publisher","award":["ADA-Center"],"award-info":[{"award-number":["ADA-Center"]}],"id":[{"id":"10.13039\/501100005017","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CRC TRR 154"],"award-info":[{"award-number":["CRC TRR 154"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bayerische Staatsregierung","award":["Energie Campus N\u00fcrnberg"],"award-info":[{"award-number":["Energie Campus N\u00fcrnberg"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Bilinear terms naturally appear in many optimization problems. Their inherent non-convexity typically makes them challenging to solve. One approach to tackle this difficulty is to use bivariate piecewise linear approximations for each variable product, which can be represented via mixed-integer linear programming (MIP) formulations. Alternatively, one can reformulate the variable products as a sum of univariate functions. Each univariate function can again be approximated by a piecewise linear function and modelled via an MIP formulation. In the literature, heterogeneous results are reported concerning which approach works better in practice, but little theoretical analysis is provided. We fill this gap by structurally comparing bivariate and univariate approximations with respect to two criteria. First, we compare the number of simplices sufficient for an <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\varepsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approximation. We derive upper bounds for univariate approximations and compare them to a lower bound for bivariate approximations. We prove that for a small prescribed approximation error\u00a0<jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\varepsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, univariate <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\varepsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approximations require fewer simplices than bivariate <jats:inline-formula><jats:alternatives><jats:tex-math>$$ \\varepsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03b5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approximations. The second criterion is the tightness of the continuous relaxations (CR) of corresponding sharp MIP formulations. Here, we prove that the CR of a bivariate MIP formulation describes the convex hull of a variable product, the so-called McCormick relaxation. In contrast, we show by a volume argument that the CRs corresponding to univariate approximations are strictly looser. This allows us to explain many of the computational effects observed in the literature and to give theoretical evidence on when to use which kind of approximation.<\/jats:p>","DOI":"10.1007\/s10898-022-01243-y","type":"journal-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T03:02:31Z","timestamp":1667444551000},"page":"789-819","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations"],"prefix":"10.1007","volume":"85","author":[{"given":"Andreas","family":"B\u00e4rmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Burlacu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lukas","family":"Hager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Kleinert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,3]]},"reference":[{"key":"1243_CR1","unstructured":"Aigner, K.-M., Burlacu, R., Liers, F., Martin, A.: Solving AC optimal power flow with discrete decisions to global optimality (2020). http:\/\/www.optimization-online.org\/DB_HTML\/2020\/08\/7981.html"},{"key":"1243_CR2","doi-asserted-by":"crossref","unstructured":"Anstreicher, K.M., Burer, S., Park, K.: Convex Hull representations for bounded products of variables (2020). https:\/\/arxiv.org\/pdf\/2004.07233.pdf","DOI":"10.1007\/s10898-021-01046-7"},{"key":"1243_CR3","doi-asserted-by":"crossref","unstructured":"Appa, G.M., Pitsoulis, L., Williams, H.P.: Handbook on Modelling for Discrete Optimization, vol. 88, Springer (2006)","DOI":"10.1007\/0-387-32942-0"},{"issue":"1","key":"1243_CR4","first-page":"113","volume":"59","author":"D Atariah","year":"2018","unstructured":"Atariah, D., Rote, G., Wintraecken, M.: Optimal triangulation of saddle surfaces. In: Beitr\u00e4ge zur algebra und geometrie\/contributions to algebra and geometry 59(1), 113\u2013126 (2018)","journal-title":"In: Beitr\u00e4ge zur algebra und geometrie\/contributions to algebra and geometry"},{"key":"1243_CR5","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Xu, Y.-F.: Optimal triangulations. In: Encyclopedia of Optimization, Springer, pp. 2757\u20132764 (2008)","DOI":"10.1007\/978-0-387-74759-0_475"},{"issue":"2","key":"1243_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/net.3230190202","volume":"19","author":"A Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Graves, S.C.: A composite algorithm for a concave-cost network flow problem. Networks 19(2), 175\u2013202 (1989)","journal-title":"Networks"},{"key":"1243_CR7","unstructured":"B\u00e4rmann, A., Burlacu, R., Hager, L., Kutzer, K.: A p5\/2-approximation algorithm for optimal piecewise linear approximations of bounded variable products (2022). https:\/\/optimization-online.org\/2022\/03\/8831\/"},{"key":"1243_CR8","unstructured":"B\u00c4rmann A., Martin, A., Schneider, O.: The bipartite boolean quadric polytope with multiple-choice constraints (2022). https:\/\/arxiv.org\/abs\/2009.11674"},{"key":"1243_CR9","unstructured":"Beach, B., Hildebrand, R., Huchette, J.: Compact mixed-integer programming relaxations in quadratic optimization (2021). https:\/\/arxiv.org\/pdf\/2011.08823.pdf"},{"key":"1243_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492913000032","volume":"22","author":"P Belotti","year":"2013","unstructured":"Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-integer nonlinear optimization. Acta Numer. 22, 1\u2013131 (2013)","journal-title":"Acta Numer."},{"key":"1243_CR11","doi-asserted-by":"publisher","unstructured":"B\u00d6ttger, T., Grimm, V., Kleinert, T., Schmidt, M.: The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling. Eur. J. Oper. Res. 297(3), 1095\u20131111 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.06.034","DOI":"10.1016\/j.ejor.2021.06.034"},{"key":"1243_CR12","unstructured":"Burlacu, R.: Adaptive Mixed-Integer Refinements for Solving Nonlinear Problems with Discrete Decisions. PhD Thesis (2020)"},{"issue":"1","key":"1243_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/10556788.2018.1556661","volume":"35","author":"R Burlacu","year":"2020","unstructured":"Burlacu, R., Gei\u00dfler, B., Schewe, L.: Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes. Optim. Methods Softw. 35(1), 37\u201364 (2020)","journal-title":"Optim. Methods Softw."},{"key":"1243_CR14","unstructured":"Correa-Posada, C.M., S\u00e1nchez-Mart\u00edn, P.: Gas network optimization: a comparison of piecewise linear models. In: Optimization (2014)"},{"issue":"9","key":"1243_CR15","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1287\/mnsc.49.9.1268.16570","volume":"49","author":"KL Croxton","year":"2003","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Manag. Sci. 49(9), 1268\u20131273 (2003)","journal-title":"Manag. Sci."},{"issue":"1","key":"1243_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.orl.2009.09.005","volume":"38","author":"C D\u2019Ambrosio","year":"2010","unstructured":"D\u2019Ambrosio, C., Lodi, A., Martello, S.: Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38(1), 39\u201346 (2010)","journal-title":"Oper. Res. Lett."},{"key":"1243_CR17","first-page":"30","volume":"28","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B.: On the significance of solving linear programming problems with some integer variables. Econom. J. Econom. Soci. 28, 30\u201344 (1960)","journal-title":"Econom. J. Econom. Soci."},{"issue":"2","key":"1243_CR18","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.ejor.2020.10.055","volume":"292","author":"J Egerer","year":"2021","unstructured":"Egerer, J., Grimm, V., Kleinert, T., Schmidt, M., Z\u00f6ttl, G.: The impact of neighboring markets on renewable locations, transmission expansion, and generation investment. Eur. J. Oper. Res. 292(2), 696\u2013713 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.10.055","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1243_CR19","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/0307039","volume":"7","author":"JE Falk","year":"1969","unstructured":"Falk, J.E.: Lagrange multipliers and nonconvex programs. SIAM J. Control 7(4), 534\u2013545 (1969)","journal-title":"SIAM J. Control"},{"issue":"3","key":"1243_CR20","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.compchemeng.2010.04.010","volume":"35","author":"DC Faria","year":"2011","unstructured":"Faria, D.C., Bagajewicz, M.J.: Novel bound contraction procedure for global optimization of bilinear MINLP problems with applications to water management problems. Comput. Chem. Eng. 35(3), 446\u2013455 (2011)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1243_CR21","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s11081-014-9249-7","volume":"15","author":"A F\u00fcgenschuh","year":"2014","unstructured":"F\u00fcgenschuh, A., Hayn, C., Michaels, D.: Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production. Optim. Eng. 15(2), 533\u2013573 (2014)","journal-title":"Optim. Eng."},{"key":"1243_CR22","unstructured":"Gei\u00dfler, B.: Towards Globally Optimal Solutions for MINLPs by Discretization Techniques with Applications in Gas Network Optimization. PhD Thesis (2011)"},{"key":"1243_CR23","doi-asserted-by":"crossref","unstructured":"Gei\u00dfler, B., Martin, A., Morsi, A., Schewe, L.: Using piecewise linear functions for solving minlps. In: Mixed Integer Nonlinear Programming, Springer, pp. 287\u2013314 (2012)","DOI":"10.1007\/978-1-4614-1927-3_10"},{"issue":"3","key":"1243_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","volume":"17","author":"RG Jeroslow","year":"1987","unstructured":"Jeroslow, R.G.: Representability in mixed integer programming, I: characterization results. Discrete Appl. Math. 17(3), 223\u2013243 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"1243_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-218X(89)90023-1","volume":"23","author":"RG Jeroslow","year":"1989","unstructured":"Jeroslow, R.G.: Representability of functions. Discrete Appl. Math. 23(2), 125\u2013137 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"1243_CR26","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1057\/jors.1985.67","volume":"36","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G., Lowe, J.K.: Experimental results on the new techniques for integer programming formulations. J. Oper. Res. Soc. 36(5), 393\u2013403 (1985)","journal-title":"J. Oper. Res. Soc."},{"key":"1243_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0121015","volume":"22","author":"RG Jeroslow","year":"1984","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modeling with integer variables. Math. Program. Study 22, 167\u2013184 (1984)","journal-title":"Math. Program. Study"},{"key":"1243_CR28","unstructured":"Knight, U.G.: Power Systems Engineering and Mathematics: International Series of Monographs in Electrical Engineering, vol. 3, Elsevier (2017)"},{"key":"1243_CR29","unstructured":"Kutzer, K.: Using Piecewise Linear Approximation Techniques to Handle Bilinear Constraints. PhD Thesis (2020)"},{"key":"1243_CR30","first-page":"84","volume":"25","author":"HM Markowitz","year":"1957","unstructured":"Markowitz, H.M., Manne, A.S.: On the solution of discrete programming problems. Econom. J. Econom. Soc. 25, 84\u2013110 (1957)","journal-title":"Econom. J. Econom. Soc."},{"issue":"2\u20133","key":"1243_CR31","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-005-0665-5","volume":"105","author":"A Martin","year":"2006","unstructured":"Martin, A., M\u00f6ller, M., Moritz, S.: Mixed integer models for the stationary case of gas network optimization. Math. Program. 105(2\u20133), 563\u2013582 (2006)","journal-title":"Math. Program."},{"issue":"1","key":"1243_CR32","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"1243_CR33","first-page":"3","volume":"8","author":"R Misener","year":"2009","unstructured":"Misener, R., Floudas, C.A.: Advances for the pooling problem: modeling, global optimization, and computational studies. Appl. Comput. Math. 8(1), 3\u201322 (2009)","journal-title":"Appl. Comput. Math."},{"issue":"2","key":"1243_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/00029890.1970.11992441","volume":"77","author":"P Monsky","year":"1970","unstructured":"Monsky, P.: On dividing a square into triangles. Am. Math. Mon. 77(2), 161\u2013164 (1970)","journal-title":"Am. Math. Mon."},{"key":"1243_CR35","unstructured":"Morsi, A.: Solving MINLPs on Loosely-Coupled Networks with Applications in Water and Gas Network Optimization. PhD Thesis (2013)"},{"key":"1243_CR36","doi-asserted-by":"crossref","unstructured":"Morsi, A., Gei\u00dfler, B., Martin, A.: Mixed integer optimization of water supply networks. In: Mathematical Optimization of Water Networks, vol. 162, Springer, pp. 35\u201354 (2012)","DOI":"10.1007\/978-3-0348-0436-3_3"},{"issue":"2","key":"1243_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM (JACM) 55(2), 1\u201329 (2008)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"1243_CR38","first-page":"1","volume":"8","author":"T Nowatzki","year":"2013","unstructured":"Nowatzki, T., Ferris, M., Sankaralingam, K., Estan, C., Vaish, N., Wood, D.: Optimization and mathematical modeling in computer architecture. Synth. Lect. Comput. Archit. 8(4), 1\u2013144 (2013)","journal-title":"Synth. Lect. Comput. Archit."},{"issue":"1","key":"1243_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00028-6","volume":"27","author":"M Padberg","year":"2000","unstructured":"Padberg, M.: Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27(1), 1\u20135 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1243_CR40","first-page":"31","volume":"4","author":"H Pottmann","year":"2000","unstructured":"Pottmann, H., Krasauskas, R., Hamann, B., Joy, K., Seibold, W.: On piecewise linear approximation of quadratic functions. J. Geom. Gr. 4(1), 31\u201353 (2000)","journal-title":"J. Geom. Gr."},{"issue":"1","key":"1243_CR41","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s10957-014-0688-2","volume":"167","author":"S Rebennack","year":"2015","unstructured":"Rebennack, S., Kallrath, J.: Continuous piecewise linear delta approximations for bivariate and multivariate functions. J. Optim. Theory Appl. 167(1), 102\u2013117 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1243_CR42","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10957-014-0687-3","volume":"167","author":"S Rebennack","year":"2015","unstructured":"Rebennack, S., Kallrath, J.: Continuous piecewise linear delta approximations for univariate functions: computing minimal breakpoint systems. J. Optim. Theory Appl. 167(2), 617\u2013643 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1243_CR43","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Global Optim. 10(4), 425\u2013437 (1997)","journal-title":"J. Global Optim."},{"issue":"4","key":"1243_CR44","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0167-6377(01)00063-3","volume":"28","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D.: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. Oper. Res. Lett. 28(4), 155\u2013160 (2001)","journal-title":"Oper. Res. Lett."},{"key":"1243_CR45","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-1-4613-0251-3_30","volume-title":"Frontiers in Global Optimization","author":"F Tardella","year":"2004","unstructured":"Tardella, F.: On the existence of polyhedral convex envelopes. In: Floudas, C.A., Pardalos, P. (eds.) Frontiers in Global Optimization, pp. 563\u2013573. Springer, Boston (2004)"},{"issue":"1","key":"1243_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(1), 3\u201357 (2015)","journal-title":"SIAM Rev."},{"issue":"2","key":"1243_CR47","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"1243_CR48","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.disopt.2007.07.001","volume":"5","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Keha, A.B., Nemhauser, G.L.: Nonconvex, lower semicontinuous piecewise linear optimization. Discrete Optim. 5(2), 467\u2013488 (2008)","journal-title":"Discrete Optim."},{"key":"1243_CR49","doi-asserted-by":"crossref","unstructured":"Wei, W., Wang, J.: Modeling and Optimization of Interdependent Energy Infrastructures, Springer (2019)","DOI":"10.1007\/978-3-030-25958-7"},{"key":"1243_CR50","unstructured":"Zelmer, A.: Designing Coupled Energy Carrier Networks By Mixed-Integer Programming Methods. PhD Thesis (2010)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01243-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:17:15Z","timestamp":1679869035000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01243-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,3]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1243"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01243-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,3]]},"assertion":[{"value":"5 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}