{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:42:18Z","timestamp":1772300538690,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T00:00:00Z","timestamp":1580428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T00:00:00Z","timestamp":1580428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J003840\/1"],"award-info":[{"award-number":["EP\/J003840\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"crossref","award":["Philip Leverhulme Prize"],"award-info":[{"award-number":["Philip Leverhulme Prize"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the global solution of bilevel programs involving nonconvex functions. Deterministic global optimization algorithms for the solution of this challenging class of optimization problems have started to emerge over the last few years. We present new schemes to generate valid bounds on the solution of nonconvex inner and outer problems and examine new strategies for branching and node selection. We integrate these within the Branch-and-Sandwich algorithm (Kleniati and Adjiman in J Glob Opt 60:425\u2013458, 2014), which is based on a branch-and-bound framework and enables the solution of a wide range of problems, including those with nonconvex inequalities and equalities in the inner problem. The impact of the proposed modifications is demonstrated on an illustrative example and 10 nonconvex bilevel test problems from the literature. It is found that the performance of the algorithm is improved for all but one problem (where the CPU time is increased by 2%), with an average reduction in CPU time of 39%. For the two most challenging problems, the CPU time required is decreased by factors of over 3 and 10.<\/jats:p>","DOI":"10.1007\/s10898-020-00874-3","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T16:03:59Z","timestamp":1580486639000},"page":"197-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2057-2922","authenticated-orcid":false,"given":"R.","family":"Paulavi\u010dius","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4573-7722","authenticated-orcid":false,"given":"C. S.","family":"Adjiman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,31]]},"reference":[{"issue":"9","key":"874_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, $$\\alpha $$BB, for general twice-differentiable constrained NLPs\u2014II. Implementation and computational results. Comput. Chem. Eng. 22(9), 1159\u20131179 (1998). https:\/\/doi.org\/10.1016\/S0098-1354(98)00218-X","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"874_CR2","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha $$BB, for general twice-differentiable constrained NLPs\u2014I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998). https:\/\/doi.org\/10.1016\/S0098-1354(98)00027-1","journal-title":"Comput. Chem. Eng."},{"issue":"5","key":"874_CR3","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1111\/itor.12153","volume":"22","author":"JS Angelo","year":"2015","unstructured":"Angelo, J.S., Barbosa, H.J.: A study on the use of heuristics to solve a bilevel programming problem. Int. Trans. Oper. Res. 22(5), 861\u2013882 (2015). https:\/\/doi.org\/10.1111\/itor.12153","journal-title":"Int. Trans. Oper. Res."},{"key":"874_CR4","doi-asserted-by":"publisher","unstructured":"Bard, J.F.: Practical bilevel optimization. In: Nonconvex Optimization and Its Applications, vol.\u00a030. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4757-2836-1","DOI":"10.1007\/978-1-4757-2836-1"},{"key":"874_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"874_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken, J., McGill, J.T.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21(1), 37\u201344 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.37","journal-title":"Oper. Res."},{"issue":"1","key":"874_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0377-2217(98)00078-2","volume":"114","author":"HI Calvete","year":"1999","unstructured":"Calvete, H.I., Gal\u00e9, C.: The bilevel linear\/linear fractional programming problem. Eur. J. Oper. Res. 114(1), 188\u2013197 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00078-2","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"874_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2007.03.034","volume":"188","author":"HI Calvete","year":"2008","unstructured":"Calvete, H.I., Gal\u00e9, C., Mateo, P.M.: A new approach for solving linear bilevel problems using genetic algorithms. Eur. J. Oper. Res. 188(1), 14\u201328 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.03.034","journal-title":"Eur. J. Oper. Res."},{"key":"874_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.amc.2017.03.051","volume":"319","author":"MS Casas-Ram\u00edrez","year":"2018","unstructured":"Casas-Ram\u00edrez, M.S., Camacho-Vallejo, J.F., Mart\u00ednez-Salazar, I.A.: Approximating solutions to a bilevel capacitated facility location problem with customer\u2019s patronization toward a list of preferences. Appl. Math. Comput. 319, 369\u2013386 (2018). https:\/\/doi.org\/10.1016\/j.amc.2017.03.051","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"874_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.ejor.2013.04.014","volume":"230","author":"M Cecchini","year":"2013","unstructured":"Cecchini, M., Ecker, J., Kupferschmid, M., Leitch, R.: Solving nonlinear principal-agent problems using bilevel programming. Eur. J. Oper. Res. 230(2), 364\u2013373 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2013.04.014","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"874_CR11","doi-asserted-by":"publisher","first-page":"3944","DOI":"10.1002\/aic.16214","volume":"64","author":"Q Chen","year":"2018","unstructured":"Chen, Q., Paulavi\u010dius, R., Adjiman, C.S., Garc\u00eda-Mu\u00f1oz, S.: An optimization framework to combine operable space maximization with design of experiments. AIChE J. 64(11), 3944\u20133957 (2018). https:\/\/doi.org\/10.1002\/aic.16214","journal-title":"AIChE J."},{"issue":"1","key":"874_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235\u2013256 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0176-2","journal-title":"Ann. Oper. Res."},{"key":"874_CR13","unstructured":"Corporation, G.D.: General Algebraic Modeling System (GAMS) Release 24.8.4. http:\/\/www.gams.com\/ (2017). Accessed 20 Sept 2017"},{"key":"874_CR14","doi-asserted-by":"publisher","unstructured":"Dempe, S.: Foundations of bilevel programming. In: Nonconvex Optimization and Its Applications, vol.\u00a061. Kluwer, Boston (2002). https:\/\/doi.org\/10.1007\/b101970","DOI":"10.1007\/b101970"},{"issue":"3","key":"874_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S Dempe","year":"2003","unstructured":"Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52(3), 333\u2013359 (2003). https:\/\/doi.org\/10.1080\/0233193031000149894","journal-title":"Optimization"},{"key":"874_CR16","doi-asserted-by":"publisher","unstructured":"Dempe, S., Kalashnikov, V., P\u00e9rez-Vald\u00e9s, G.A., Kalashnykova, N.: Bilevel programming problems. In: Energy Systems. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-45827-3","DOI":"10.1007\/978-3-662-45827-3"},{"key":"874_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00764-3","author":"H Djelassi","year":"2019","unstructured":"Djelassi, H., Glass, M., Mitsos, A.: Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints. J. Glob. Optim. (2019). https:\/\/doi.org\/10.1007\/s10898-019-00764-3","journal-title":"J. Glob. Optim."},{"issue":"3","key":"874_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/nav.3800240307","volume":"24","author":"JE Falk","year":"1977","unstructured":"Falk, J.E., Hoffman, K.: A nonconvex max\u2013min problem. Nav. Res. Logist. Q. 24(3), 441\u2013450 (1977). https:\/\/doi.org\/10.1002\/nav.3800240307","journal-title":"Nav. Res. Logist. Q."},{"issue":"6","key":"874_CR19","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6), 1615\u20131637 (2017). https:\/\/doi.org\/10.1287\/opre.2017.1650","journal-title":"Oper. Res."},{"key":"874_CR20","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1981.156","author":"J Fortuny-Amat","year":"1981","unstructured":"Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. (1981). https:\/\/doi.org\/10.1057\/jors.1981.156","journal-title":"J. Oper. Res. Soc."},{"key":"874_CR21","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, 3rd edn. Springer, Berlin (1996). https:\/\/doi.org\/10.1007\/978-3-662-03199-5","edition":"3"},{"issue":"3","key":"874_CR22","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10898-013-0121-7","volume":"60","author":"PM Kleniati","year":"2014","unstructured":"Kleniati, P.M., Adjiman, C.S.: Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: theoretical development. J. Glob. Optim. 60(3), 425\u2013458 (2014). https:\/\/doi.org\/10.1007\/s10898-013-0121-7","journal-title":"J. Glob. Optim."},{"issue":"3","key":"874_CR23","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-013-0120-8","volume":"60","author":"PM Kleniati","year":"2014","unstructured":"Kleniati, P.M., Adjiman, C.S.: Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: convergence analysis and numerical results. J. Glob. Optim. 60(3), 459\u2013481 (2014). https:\/\/doi.org\/10.1007\/s10898-013-0120-8","journal-title":"J. Glob. Optim."},{"key":"874_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.compchemeng.2014.06.004","volume":"72","author":"PM Kleniati","year":"2014","unstructured":"Kleniati, P.M., Adjiman, C.S.: A generalization of the Branch-and-Sandwich algorithm: from continuous to mixed-integer nonlinear bilevel problems. Comput. Chem. Eng. 72, 373\u2013386 (2014). https:\/\/doi.org\/10.1016\/j.compchemeng.2014.06.004","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"874_CR25","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173\u2013187 (1999). https:\/\/doi.org\/10.1287\/ijoc.11.2.173","journal-title":"INFORMS J. Comput."},{"key":"874_CR26","unstructured":"Mitsos, A., Barton, P.I.: A Test Set for Bilevel Programs. http:\/\/www.researchgate.net\/publication\/228455291 (2007). (Last updated 19 Sept. 2007)"},{"issue":"4","key":"874_CR27","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-007-9260-z","volume":"42","author":"A Mitsos","year":"2008","unstructured":"Mitsos, A., Lemonidis, P., Barton, P.I.: Global solution of bilevel programs with a nonconvex inner program. J. Glob. Optim. 42(4), 475\u2013513 (2008). https:\/\/doi.org\/10.1007\/s10898-007-9260-z","journal-title":"J. Glob. Optim."},{"issue":"5","key":"874_CR28","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1287\/opre.38.5.911","volume":"38","author":"JT Moore","year":"1990","unstructured":"Moore, J.T., Bard, J.F.: The mixed integer linear bilevel programming problem. Oper. Res. 38(5), 911\u2013921 (1990). https:\/\/doi.org\/10.1287\/opre.38.5.911","journal-title":"Oper. Res."},{"key":"874_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106609","author":"R Paulavi\u010dius","year":"2020","unstructured":"Paulavi\u010dius, R., Gao, J., Kleniati, P.M., Adjiman, C.S.: BASBL: Branch-And-Sandwich BiLevel solver: implementation and computational study with the BASBLib test set. Comput. Chem. Eng. (2020). https:\/\/doi.org\/10.1016\/j.compchemeng.2019.106609","journal-title":"Comput. Chem. Eng."},{"key":"874_CR30","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1016\/B978-0-444-63428-3.50334-9","volume-title":"26th European Symposium on Computer Aided Process Engineering, Computer Aided Chemical Engineering","author":"R Paulavi\u010dius","year":"2016","unstructured":"Paulavi\u010dius, R., Kleniati, P.M., Adjiman, C.S.: Global optimization of nonconvex bilevel problems: implementation and computational study of the Branch-and-Sandwich algorithm. In: Kravanja, Z., Bogataj, M. (eds.) 26th European Symposium on Computer Aided Process Engineering, Computer Aided Chemical Engineering, vol. 38, pp. 1977\u20131982. Elsevier, Amsterdam (2016). https:\/\/doi.org\/10.1016\/B978-0-444-63428-3.50334-9"},{"key":"874_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-9093-7","volume-title":"Simplicial Global Optimization. Springer Briefs in Optimization","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial Global Optimization. Springer Briefs in Optimization. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4614-9093-7"},{"issue":"2","key":"874_CR32","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11590-009-0156-3","volume":"4","author":"R Paulavi\u010dius","year":"2010","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J., Grothey, A.: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2), 173\u2013183 (2010). https:\/\/doi.org\/10.1007\/s11590-009-0156-3","journal-title":"Optim. Lett."},{"key":"874_CR33","unstructured":"Sahinidis, N.V.: BARON 14.4.0: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2014)"},{"key":"874_CR34","unstructured":"Sahinidis, N.V.: BARON 17.4.1: global optimization of mixed-integer nonlinear programs, User\u2019s Manual (2017)"},{"key":"874_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00228-2","volume-title":"Nondifferentiable and Two-Level Mathematical Programming","author":"K Shimizu","year":"1997","unstructured":"Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and Two-Level Mathematical Programming, vol. 102. Kluwer, Boston (1997). https:\/\/doi.org\/10.1016\/S0377-2217(97)00228-2"},{"issue":"2","key":"874_CR36","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","volume":"257","author":"A Sinha","year":"2017","unstructured":"Sinha, A., Malo, P., Deb, K.: Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur. J. Oper. Res. 257(2), 395\u2013411 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.08.027","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"874_CR37","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/S0377-2217(01)00307-1","volume":"142","author":"O Stein","year":"2002","unstructured":"Stein, O., Still, G.: On generalized semi-infinite optimization and bilevel optimization. Eur. J. Oper. Res. 142(3), 444\u2013462 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(01)00307-1","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"874_CR38","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1080\/02331930410001661190","volume":"53","author":"G Still","year":"2004","unstructured":"Still, G.: Solving generalized semi-infinite programs by reduction to simpler problems. Optimization 53(1), 19\u201338 (2004). https:\/\/doi.org\/10.1080\/02331930410001661190","journal-title":"Optimization"},{"key":"874_CR39","doi-asserted-by":"publisher","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: theory, algorithms, software, and applications. In: Nonconvex Optimization and Its Applications. Kluwer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3532-1","DOI":"10.1007\/978-1-4757-3532-1"},{"issue":"2","key":"874_CR40","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0581-8","journal-title":"Math. Program."},{"issue":"2","key":"874_CR41","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10898-008-9321-y","volume":"44","author":"A Tsoukalas","year":"2008","unstructured":"Tsoukalas, A., Rustem, B., Pistikopoulos, E.N.: A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems. J. Glob. Optim. 44(2), 235\u2013250 (2008). https:\/\/doi.org\/10.1007\/s10898-008-9321-y","journal-title":"J. Glob. Optim."},{"key":"874_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2013","unstructured":"Tuy, H.: Convex Analysis and Global Optimization, vol. 22. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-1-4757-2809-5"},{"issue":"3","key":"874_CR43","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"LN Vicente","year":"1994","unstructured":"Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: a bibliography review. J. Glob. Optim. 5(3), 291\u2013306 (1994). https:\/\/doi.org\/10.1007\/BF01096458","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00874-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00874-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00874-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T00:41:24Z","timestamp":1611967284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00874-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,31]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["874"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00874-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,31]]},"assertion":[{"value":"27 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}