{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T03:12:30Z","timestamp":1771470750060,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T00:00:00Z","timestamp":1547424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T00:00:00Z","timestamp":1547424000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100007000","name":"Laboratory Directed Research and Development","doi-asserted-by":"publisher","award":["20170201ER"],"award-info":[{"award-number":["20170201ER"]}],"id":[{"id":"10.13039\/100007000","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,8]]},"DOI":"10.1007\/s10898-018-00734-1","type":"journal-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T05:05:13Z","timestamp":1547442313000},"page":"639-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4550-1100","authenticated-orcid":false,"given":"Harsha","family":"Nagarajan","sequence":"first","affiliation":[]},{"given":"Mowen","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Site","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Bent","sequence":"additional","affiliation":[]},{"given":"Kaarthik","family":"Sundar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,14]]},"reference":[{"issue":"1","key":"734_CR1","doi-asserted-by":"publisher","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. Progr. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Progr. Comput."},{"issue":"2","key":"734_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"FA Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"734_CR3","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s10898-012-9848-9","volume":"56","author":"P Belotti","year":"2013","unstructured":"Belotti, P.: Bound reduction using pairs of linear inequalities. J. Glob. Optim. 56(3), 787\u2013819 (2013)","journal-title":"J. Glob. Optim."},{"key":"734_CR4","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: On feasibility based bounds tightening (2012). \n                    https:\/\/hal.archives-ouvertes.fr\/file\/index\/docid\/935464\/filename\/377.pdf"},{"issue":"4\u20135","key":"734_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"734_CR6","unstructured":"Bent, R., Nagarajan, H., Sundar, K., Wang, S., Hijazi, H.: A polyhedral outer-approximation, dynamic-discretization optimization solver, 1.x. Tech. rep., Los Alamos National Laboratory, Los Alamos, NM, USA (2017). \n                    https:\/\/github.com\/lanl-ansi\/POD.jl"},{"issue":"3","key":"734_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.compchemeng.2007.03.011","volume":"32","author":"ML Bergamini","year":"2008","unstructured":"Bergamini, M.L., Grossmann, I., Scenna, N., Aguirre, P.: An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput. Chem. Eng. 32(3), 477\u2013493 (2008)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"734_CR8","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2015.12.018","volume":"252","author":"F Boukouvala","year":"2016","unstructured":"Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO. Eur. J. Oper. Res. 252(3), 701\u2013727 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"734_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2013a collection of test models for mixed-integer nonlinear programming. Inf. J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"Inf. J. Comput."},{"issue":"4","key":"734_CR10","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10898-009-9484-1","volume":"47","author":"S Cafieri","year":"2010","unstructured":"Cafieri, S., Lee, J., Liberti, L.: On convex relaxations of quadrilinear terms. J. Glob. Optim. 47(4), 661\u2013685 (2010)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"734_CR11","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s10898-015-0342-z","volume":"64","author":"PM Castro","year":"2016","unstructured":"Castro, P.M.: Normalized multiparametric disaggregation: An efficient relaxation for mixed-integer bilinear problems. J. Glob. Optim. 64(4), 765\u2013784 (2016)","journal-title":"J. Glob. Optim."},{"key":"734_CR12","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.compchemeng.2014.03.025","volume":"72","author":"PM Castro","year":"2015","unstructured":"Castro, P.M.: Tightening piecewise McCormick relaxations for bilinear problems. Comput. Chem. Eng. 72, 300\u2013311 (2015)","journal-title":"Comput. Chem. Eng."},{"key":"734_CR13","doi-asserted-by":"crossref","unstructured":"Coffrin, C., Hijazi, H.L., Van\u00a0Hentenryck, P.: Strengthening convex relaxations with bound tightening for power network optimization. In: Principles and Practice of Constraint Programming, pp. 39\u201357. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-23219-5_4"},{"issue":"2","key":"734_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: A modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"1","key":"734_CR15","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."},{"issue":"3","key":"734_CR16","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":"8","key":"734_CR17","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1002\/aic.12754","volume":"58","author":"DC Faria","year":"2012","unstructured":"Faria, D.C., Bagajewicz, M.J.: A new approach for global optimization of a class of MINLP problems with applications to water management and pooling problems. AIChE J. 58(8), 2320\u20132335 (2012)","journal-title":"AIChE J."},{"issue":"9","key":"734_CR18","doi-asserted-by":"publisher","first-page":"3276","DOI":"10.1002\/aic.14088","volume":"59","author":"IE Grossmann","year":"2013","unstructured":"Grossmann, I.E., Trespalacios, F.: Systematic modeling of discrete-continuous optimization models through generalized disjunctive programming. AIChE J. 59(9), 3276\u20133295 (2013)","journal-title":"AIChE J."},{"issue":"7","key":"734_CR19","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1002\/aic.12109","volume":"56","author":"M Hasan","year":"2010","unstructured":"Hasan, M., Karimi, I.: Piecewise linear relaxation of bilinear programs using bivariate partitioning. AIChE J. 56(7), 1880\u20131893 (2010)","journal-title":"AIChE J."},{"issue":"3","key":"734_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s12532-016-0112-z","volume":"9","author":"H Hijazi","year":"2017","unstructured":"Hijazi, H., Coffrin, C., Van Hentenryck, P.: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems. Math. Progr. Comput. 9(3), 321\u2013367 (2017)","journal-title":"Math. Progr. Comput."},{"issue":"1","key":"734_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF00934594","volume":"30","author":"W Hock","year":"1980","unstructured":"Hock, W., Schittkowski, K.: Test examples for nonlinear programming codes. J. Optim. Theory Appl. 30(1), 127\u2013129 (1980)","journal-title":"J. Optim. Theory Appl."},{"key":"734_CR22","volume-title":"Handbook of global optimization","author":"R Horst","year":"2013","unstructured":"Horst, R., Pardalos, P.M.: Handbook of global optimization, vol. 2. Springer, Berlin (2013)"},{"key":"734_CR23","volume-title":"Global optimization: deterministic approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global optimization: deterministic approaches. Springer, Berlin (2013)"},{"issue":"4","key":"734_CR24","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.compchemeng.2005.11.005","volume":"30","author":"R Karuppiah","year":"2006","unstructured":"Karuppiah, R., Grossmann, I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30(4), 650\u2013673 (2006)","journal-title":"Comput. Chem. Eng."},{"issue":"6","key":"734_CR25","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1287\/opre.2016.1489","volume":"64","author":"B Kocuk","year":"2016","unstructured":"Kocuk, B., Dey, S.S., Sun, X.A.: Strong SOCP relaxations for the optimal power flow problem. Oper. Res. 64(6), 1177\u20131196 (2016)","journal-title":"Oper. Res."},{"key":"734_CR26","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.compchemeng.2013.01.016","volume":"53","author":"SP Kolodziej","year":"2013","unstructured":"Kolodziej, S.P., Grossmann, I.E., Furman, K.C., Sawaya, N.W.: A discretization-based approach for the optimization of the multiperiod blend scheduling problem. Comput. Chem. Eng. 53, 122\u2013142 (2013)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"734_CR27","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/ijoc.1120.0527","volume":"25","author":"HL Li","year":"2012","unstructured":"Li, H.L., Huang, Y.H., Fang, S.C.: A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems. Inf. J. Comput. 25(4), 643\u2013653 (2012)","journal-title":"Inf. J. Comput."},{"issue":"1","key":"734_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2007.00622.x","volume":"15","author":"L Liberti","year":"2008","unstructured":"Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. Int. Trans. Oper. Res. 15(1), 1\u201317 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"734_CR29","doi-asserted-by":"crossref","unstructured":"Lu, M., Nagarajan, H., Bent, R., Eksioglu, S., Mason, S.: Tight piecewise convex relaxations for global optimization of optimal power flow. In: Power Systems Computation Conference (PSCC), pp. 1\u20137. IEEE (2018)","DOI":"10.23919\/PSCC.2018.8442456"},{"issue":"3","key":"734_CR30","doi-asserted-by":"publisher","first-page":"2539","DOI":"10.1109\/TPWRS.2017.2761178","volume":"33","author":"M Lu","year":"2018","unstructured":"Lu, M., Nagarajan, H., Yamangil, E., Bent, R., Backhaus, S., Barnes, A.: Optimal transmission line switching under geomagnetic disturbances. IEEE Trans. Power Syst. 33(3), 2539\u20132550 (2018). \n                    https:\/\/doi.org\/10.1109\/TPWRS.2017.2761178","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"734_CR31","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Progr. 136(2), 325\u2013351 (2012)","journal-title":"Math. Progr."},{"issue":"1","key":"734_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\u2013convex underestimating problems. Math. Progr. 10(1), 147\u2013175 (1976)","journal-title":"Math. Progr."},{"issue":"3","key":"734_CR33","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1002\/aic.10717","volume":"52","author":"CA Meyer","year":"2006","unstructured":"Meyer, C.A., Floudas, C.A.: Global optimization of a combinatorially complex generalized pooling problem. AIChE J. 52(3), 1027\u20131037 (2006)","journal-title":"AIChE J."},{"key":"734_CR34","unstructured":"Misener, R., Floudas, C.: Generalized pooling problem (2011). Available from Cyber-Infrastructure for MINLP [\n                    www.minlp.org\n                    \n                  , a collaboration of Carnegie Mellon University and IBM Research] at: \n                    www.minlp.org\/library\/problem\/index.php?i=123"},{"issue":"1","key":"734_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: Global mixed-integer quadratic optimizer. J. Glob. Optim. 57(1), 3\u201350 (2013)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"734_CR36","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.compchemeng.2011.01.026","volume":"35","author":"R Misener","year":"2011","unstructured":"Misener, R., Thompson, J.P., Floudas, C.A.: APOGEE: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Comput. Chem. Eng. 35(5), 876\u2013892 (2011)","journal-title":"Comput. Chem. Eng."},{"key":"734_CR37","doi-asserted-by":"crossref","unstructured":"Mouret, S., Grossmann, I.E., Pestiaux, P.: Tightening the linear relaxation of a mixed integer nonlinear program using constraint programming. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 208\u2013222. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01929-6_16"},{"key":"734_CR38","doi-asserted-by":"crossref","unstructured":"Nagarajan, H., Lu, M., Yamangil, E., Bent, R.: Tightening McCormick relaxations for nonlinear programs via dynamic multivariate partitioning. In: International Conference on Principles and Practice of Constraint Programming, pp. 369\u2013387. Springer, Berlin (2016)","DOI":"10.1007\/978-3-319-44953-1_24"},{"key":"734_CR39","unstructured":"Nagarajan, H., Pagilla, P., Darbha, S., Bent, R., Khargonekar, P.: Optimal configurations to minimize disturbance propagation in manufacturing networks. In: American Control Conference (ACC), 2017, pp. 2213\u20132218. IEEE (2017)"},{"key":"734_CR40","doi-asserted-by":"crossref","unstructured":"Nagarajan, H., Sundar, K., Hijazi, H., Bent, R.: Convex hull formulations for mixed-integer multilinear functions. In: Proceedings of the XIV International Global Optimization Workshop (LEGO 18) (2018)","DOI":"10.1063\/1.5090004"},{"key":"734_CR41","unstructured":"Nagarajan, H., Yamangil, E., Bent, R., Van\u00a0Hentenryck, P., Backhaus, S.: Optimal resilient transmission grid design. In: Power Systems Computation Conference (PSCC), 2016, pp. 1\u20137. IEEE (2016)"},{"issue":"3","key":"734_CR42","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/s10601-016-9267-5","volume":"22","author":"Y Puranik","year":"2017","unstructured":"Puranik, Y., Sahinidis, N.V.: Domain reduction techniques for global NLP and MINLP optimization. Constraints 22(3), 338\u2013376 (2017)","journal-title":"Constraints"},{"key":"734_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. Glob. Optim. 10, 425\u2013437 (1997). \n                    https:\/\/doi.org\/10.1023\/A:1008217604285","journal-title":"J. Glob. Optim."},{"issue":"1\u20132","key":"734_CR44","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10898-016-0401-0","volume":"67","author":"JP Ruiz","year":"2017","unstructured":"Ruiz, J.P., Grossmann, I.E.: Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques. J. Glob. Optim. 67(1\u20132), 43\u201358 (2017)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"734_CR45","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex nlps and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"734_CR46","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/A:1011295715398","volume":"19","author":"HS Ryoo","year":"2001","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Analysis of bounds for multilinear functions. J. Glob. Optim. 19(4), 403\u2013424 (2001)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"734_CR47","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: Baron: A general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"734_CR48","unstructured":"Speakman, E.E.: Volumetric Guidance for Handling Triple Products in Spatial Branch-and-Bound by. Ph.D. thesis, University of Michigan (2017)"},{"issue":"2","key":"734_CR49","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)","journal-title":"Math. Program."},{"issue":"3","key":"734_CR50","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.ejor.2013.03.042","volume":"229","author":"JP Teles","year":"2013","unstructured":"Teles, J.P., Castro, P.M., Matos, H.A.: Univariate parameterization for global optimization of mixed-integer polynomial problems. Eur. J. Oper. Res. 229(3), 613\u2013625 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"734_CR51","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/ijoc.2015.0669","volume":"28","author":"F Trespalacios","year":"2016","unstructured":"Trespalacios, F., Grossmann, I.E.: Cutting plane algorithm for convex generalized disjunctive programs. Inf. J. Comput. 28(2), 209\u2013222 (2016)","journal-title":"Inf. J. Comput."},{"issue":"1","key":"734_CR52","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Progr. 128(1), 49\u201372 (2011)","journal-title":"Math. Progr."},{"issue":"4","key":"734_CR53","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1002\/aic.11425","volume":"54","author":"DS Wicaksono","year":"2008","unstructured":"Wicaksono, D.S., Karimi, I.: Piecewise MILP under-and overestimators for global optimization of bilinear programs. AIChE J. 54(4), 991\u20131008 (2008)","journal-title":"AIChE J."},{"key":"734_CR54","unstructured":"Wu, F., Nagarajan, H., Zlotnik, A., Sioshansi, R., Rudkevich, A.: Adaptive convex relaxations for gas pipeline network optimization. In: American Control Conference (ACC), 2017, pp. 4710\u20134716. IEEE (2017)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-00734-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-00734-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-00734-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:31:01Z","timestamp":1589700661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-00734-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,14]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["734"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-00734-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,14]]},"assertion":[{"value":"8 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}