{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T01:34:15Z","timestamp":1746408855303,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:00:00Z","timestamp":1558396800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:00:00Z","timestamp":1558396800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 418411-13","CRDPJ 485798-15"],"award-info":[{"award-number":["RGPIN 418411-13","CRDPJ 485798-15"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10898-019-00786-x","type":"journal-article","created":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:12:11Z","timestamp":1558555931000},"page":"595-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs"],"prefix":"10.1007","volume":"75","author":[{"given":"Emmanuel","family":"Ogbe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5933-7914","authenticated-orcid":false,"given":"Xiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,21]]},"reference":[{"key":"786_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)"},{"key":"786_CR2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"786_CR3","doi-asserted-by":"crossref","first-page":"2120","DOI":"10.1002\/aic.12419","volume":"57","author":"X Li","year":"2011","unstructured":"Li, X., Armagan, E., Tomasgard, A., Barton, P.I.: Stochastic pooling problem for natural gas production network design and operation under uncertainty. AIChE J. 57, 2120\u20132135 (2011)","journal-title":"AIChE J."},{"key":"786_CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10957-011-9888-1","volume":"151","author":"X Li","year":"2011","unstructured":"Li, X., Tomasgard, A., Barton, P.I.: Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs. J. Optim. Theory Appl. 151, 425\u2013454 (2011)","journal-title":"J. Optim. Theory Appl."},{"issue":"7","key":"786_CR5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/0098-1354(91)85027-R","volume":"15","author":"N Sahinidis","year":"1991","unstructured":"Sahinidis, N., Grossmann, I.: Convergence properties of generalized Benders decomposition. Comput. Chem. Eng. 15(7), 481\u2013491 (1991)","journal-title":"Comput. Chem. Eng."},{"key":"786_CR6","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1109\/32.256858","volume":"19","author":"O Berman","year":"1993","unstructured":"Berman, O., Ashrafi, N.: Optimization models for reliability of modular software systems. IEEE Trans. Softw. Eng. 19, 1119\u20131123 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"786_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems for Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems for Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"9","key":"786_CR8","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"CS Adjiman","year":"2000","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed-integer nonlinear problems. AIChE J. 46(9), 1769\u20131797 (2000)","journal-title":"AIChE J."},{"issue":"9","key":"786_CR9","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/0098-1354(94)E0006-9","volume":"18","author":"T Westerlund","year":"1994","unstructured":"Westerlund, T., Pettersson, F., Grossmann, I.E.: Optimization of pump configurations as a MINLP problem. Comput. Chem. Eng. 18(9), 845\u2013858 (1994)","journal-title":"Comput. Chem. Eng."},{"key":"786_CR10","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1002\/aic.690320408","volume":"32","author":"M Duran","year":"1986","unstructured":"Duran, M., Grossmann, I.: A mixed-integer nonlinear programming algorithm for process systems synthesis. AIChE J. 32, 592\u2013606 (1986)","journal-title":"AIChE J."},{"key":"786_CR11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/opre.31.1.84","volume":"31","author":"J Bloom","year":"1983","unstructured":"Bloom, J.: Solving an electricity generating capacity expansion problem by generalized benders\u2019 decomposition. Oper. Res. 31, 84\u2013100 (1983)","journal-title":"Oper. Res."},{"key":"786_CR12","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J Falk","year":"1969","unstructured":"Falk, J., Soland, R.: An algorithm for seperable nonconvex programming problems. Manag. Sci. 15, 550\u2013569 (1969)","journal-title":"Manag. Sci."},{"key":"786_CR13","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1287\/mnsc.17.11.759","volume":"17","author":"R Soland","year":"1971","unstructured":"Soland, R.: An algorithm for seperable nonconvex programming problems II: nonconvex constraints. Manag. Sci. 17, 759\u2013772 (1971)","journal-title":"Manag. Sci."},{"key":"786_CR14","doi-asserted-by":"crossref","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, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"786_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M Fisher","year":"1981","unstructured":"Fisher, M.: Lagrangian relaxation methods for solving integer programming problems. Manag. Sci. 27, 1\u201318 (1981)","journal-title":"Manag. Sci."},{"key":"786_CR16","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.: Branch and price: column generation for solving huge integer programs. Oper. Res. 46, 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"786_CR17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger lagrangean bounds. Math. Program. 39, 215\u2013228 (1987)","journal-title":"Math. Program."},{"key":"786_CR18","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.: Validation of subgradient optimization. Math. Program. 6, 62\u201388 (1974)","journal-title":"Math. Program."},{"issue":"1","key":"786_CR19","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF02591718","volume":"25","author":"TJ Van Roy","year":"1983","unstructured":"Van Roy, T.J.: Cross decomposition for mixed integer programming. Math. Program. 25(1), 46\u201363 (1983)","journal-title":"Math. Program."},{"key":"786_CR20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ejor.2016.08.005","volume":"256","author":"E Ogbe","year":"2017","unstructured":"Ogbe, E., Li, X.: A new cross decomposition method for stochastic mixed-integer linear programming. Eur. J. Oper. Res. 256, 487\u2013499 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"786_CR21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"J Zamora","year":"1999","unstructured":"Zamora, J., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, binear and linear fractional terms. J. Glob. Optim. 14, 217\u2013249 (1999)","journal-title":"J. Glob. Optim."},{"key":"786_CR22","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8, 107\u2013138 (1996)","journal-title":"J. Glob. Optim."},{"key":"786_CR23","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1007\/s10957-013-0396-3","volume":"161","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: A framework for globally optimizing mixed-integer signomial programs. J. Optim. Theory Appl. 161, 905\u2013932 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"786_CR24","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10898-007-9203-8","volume":"41","author":"R Karuppiah","year":"2008","unstructured":"Karuppiah, R., Grossmann, I.E.: A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J. Glob. Optim. 41, 163\u2013186 (2008)","journal-title":"J. Glob. Optim."},{"key":"786_CR25","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59, 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"786_CR26","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1016\/j.compchemeng.2003.09.017","volume":"28","author":"N Sahinidis","year":"2004","unstructured":"Sahinidis, N.: Optimization under uncertainty: state-of-the-art and opportunities. Comput. Chem. Eng. 28, 971\u2013983 (2004)","journal-title":"Comput. Chem. Eng."},{"key":"786_CR27","volume-title":"Introduction to Stochastic Programming","author":"J Birge","year":"2010","unstructured":"Birge, J., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2010)"},{"key":"786_CR28","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Van Slyke","year":"1969","unstructured":"Van Slyke, R.M., Wets, R.: L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17, 638\u2013663 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"9","key":"786_CR29","doi-asserted-by":"crossref","first-page":"5099","DOI":"10.1021\/ie101568v","volume":"50","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Adams, T.A., Barton, P.I.: Optimal design and operation of static energy polygeneration systems. Ind. Eng. Chem. Res. 50(9), 5099\u20135113 (2011)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"3","key":"786_CR30","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.ejor.2014.10.008","volume":"242","author":"SM Frank","year":"2015","unstructured":"Frank, S.M., Rebennack, S.: Optimal design of mixed AC\u2013DC distribution systems for commercial buildings: a nonconvex generalized benders decomposition approach. Eur. J. Oper. Res. 242(3), 710\u2013729 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"786_CR31","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"4","key":"786_CR32","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"786_CR33","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10898-007-9203-8","volume":"41","author":"R Karuppiah","year":"2008","unstructured":"Karuppiah, R., Grossmann, I.: A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J. Glob. Optim. 41, 163\u2013186 (2008)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"786_CR34","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-012-1191-5","volume":"210","author":"Y Shim","year":"2013","unstructured":"Shim, Y., Fodstad, M., Gabriel, S.A., Tomasgard, A.: A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints. Ann. Oper. Res. 210(1), 5\u201331 (2013)","journal-title":"Ann. Oper. Res."},{"key":"786_CR35","unstructured":"Kannan, R.: Algorithms, analysis and software for the global optimization of two-stage stochastic programs. Ph.D. thesis, Massachusetts Institute of Technology (2018)"},{"key":"786_CR36","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"TJ Van Roy","year":"1986","unstructured":"Van Roy, T.J.: A cross decomposition algorithm for capacitated facility location. Oper. Res. 34, 145\u2013163 (1986)","journal-title":"Oper. Res."},{"key":"786_CR37","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01580863","volume":"47","author":"K Holmberg","year":"1990","unstructured":"Holmberg, K.: On the convergence of cross decomposition. Math. Program. 47, 269\u2013296 (1990)","journal-title":"Math. Program."},{"key":"786_CR38","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/S0377-2217(96)00139-7","volume":"97","author":"K Holmberg","year":"1997","unstructured":"Holmberg, K.: Mean value cross decomposition applied to integer programming problems. Eur. J. Oper. Res. 97, 124\u2013138 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"786_CR39","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1109\/59.260957","volume":"8","author":"N Deep","year":"1993","unstructured":"Deep, N., Shahidehpour, S.: Cross decomposition for multi-area optimal reactive power planning. IEEE Trans. Power Syst. 8, 1539\u20131544 (1993)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"786_CR40","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-016-1001-y","volume":"157","author":"S Mitra","year":"2016","unstructured":"Mitra, S., Garcia-Herreros, P., Grossmann, I.E.: A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems. Math. Program. 157(1), 95\u2013119 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"786_CR41","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8e","year":"1999","unstructured":"Car\u00f8e, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1\u20132), 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"key":"786_CR42","volume-title":"Optimization Theory for Large Systems","author":"L Lasdon","year":"1970","unstructured":"Lasdon, L.: Optimization Theory for Large Systems, 1st edn. Macmillian, Toronto (1970)","edition":"1"},{"issue":"3","key":"786_CR43","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"J Birge","year":"1988","unstructured":"Birge, J., Louveaux, F.V.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3), 384\u2013392 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"786_CR44","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/B978-0-444-63578-5.50118-3","volume":"37","author":"E Ogbe","year":"2015","unstructured":"Ogbe, E., Li, X.: Multicolumn-multicut cross decomposition for stochastic mixed-integer linear programming. Comput. Aided Chem. Eng. 37, 737\u2013742 (2015)","journal-title":"Comput. Aided Chem. Eng."},{"issue":"4","key":"786_CR45","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"C Maranas","year":"1997","unstructured":"Maranas, C., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351\u2013369 (1997)","journal-title":"Comput. Chem. Eng."},{"key":"786_CR46","first-page":"29","volume":"25","author":"C Haverly","year":"1978","unstructured":"Haverly, C.: Studies of the behaviour of recursion for the pooling problem. ACM SIGMAP Bull. 25, 29\u201332 (1978)","journal-title":"ACM SIGMAP Bull."},{"key":"786_CR47","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1111243.1111244","volume":"26","author":"C Haverly","year":"1979","unstructured":"Haverly, C.: Behaviour of recursion model\u2014more studies. ACM SIGMAP Bull. 26, 22\u201328 (1979)","journal-title":"ACM SIGMAP Bull."},{"issue":"2","key":"786_CR48","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/aic.11385","volume":"54","author":"A Selot","year":"2008","unstructured":"Selot, A., Kuok, L.K., Robinson, M., Mason, T.L., Barton, P.I.: A short-term operational planning model for natural gas production systems. AIChE J. 54(2), 495\u2013515 (2008)","journal-title":"AIChE J."},{"issue":"3\u20134","key":"786_CR49","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/58859.58863","volume":"23","author":"A Brook","year":"1988","unstructured":"Brook, A., Kendrick, D., Meeraus, A.: Gams, a user\u2019s guide. SIGNUM Newsl. 23(3\u20134), 10\u201311 (1988)","journal-title":"SIGNUM Newsl."},{"key":"786_CR50","unstructured":"MATLAB, version 8.3 (R2014a) The MathWorks Inc., Natick, Massachusetts (2014)"},{"key":"786_CR51","unstructured":"Ferris, M., Dirkse, S., Ramakrishnan, J.: GDXMRW: Interfacing GAMS and MATLAB. http:\/\/research.cs.wisc.edu\/math-prog\/matlab.html (2016). Accessed August"},{"issue":"1","key":"786_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"786_CR53","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: CONOPT\u2014a large-scale GRG code. ORSA J. Comput. 6, 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"key":"786_CR54","unstructured":"IBM: IBM ILOG CPLEX OPTIMIZER: high-performance mathematical programming engine (2014)"},{"issue":"4","key":"786_CR55","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/050639284","volume":"17","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: A proximal-projection bundle method for Lagrangian relaxation, including semidefinite programming. SIAM J. Optim. 17(4), 1015\u20131034 (2006)","journal-title":"SIAM J. Optim."},{"key":"786_CR56","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1021095211251","volume":"3","author":"EP Gatzke","year":"2002","unstructured":"Gatzke, E.P., Tolsma, J.E., Barton, P.I.: Construction of convex relaxations using automated code generation technique. Optim. Eng. 3, 305\u2013326 (2002)","journal-title":"Optim. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00786-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00786-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00786-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T05:36:37Z","timestamp":1607924197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00786-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,21]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["786"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00786-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,5,21]]},"assertion":[{"value":"16 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}