{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:37:04Z","timestamp":1770741424885,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1562578"],"award-info":[{"award-number":["1562578"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["248941\/2013-5"],"award-info":[{"award-number":["248941\/2013-5"]}],"id":[{"id":"10.13039\/501100003593","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":[[2020,6]]},"DOI":"10.1007\/s10898-019-00844-4","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T07:07:16Z","timestamp":1571814436000},"page":"227-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem"],"prefix":"10.1007","volume":"77","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burak","family":"Kocuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9941-7804","authenticated-orcid":false,"given":"Asteroide","family":"Santana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"key":"844_CR1","volume-title":"A Reformulation\u2013Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation\u2013Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer Science & Business Media, Berlin (2013)"},{"issue":"3","key":"844_CR2","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"844_CR3","doi-asserted-by":"crossref","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: LP and SOCP-based alternatives to sum of squares optimization. In 2014 48th Annual Conference on Information Sciences and Systems (CISS), pp. 1\u20135. IEEE (2014)","DOI":"10.1109\/CISS.2014.6814141"},{"issue":"2","key":"844_CR4","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. Op. Res. 8(2), 273\u2013286 (1983)","journal-title":"Math. Op. Res."},{"issue":"4","key":"844_CR5","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. Global Optim. 19(4), 403\u2013424 (2001)","journal-title":"J. Global Optim."},{"issue":"2","key":"844_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1021924706467","volume":"25","author":"L Liberti","year":"2003","unstructured":"Liberti, L., Pantelides, C.C.: Convex envelopes of monomials of odd degree. J. Global Optim. 25(2), 157\u2013168 (2003)","journal-title":"J. Global Optim."},{"issue":"4","key":"844_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/nav.20011","volume":"51","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: Concave envelopes of monomial functions over rectangles. Naval Res. Logist. (NRL) 51(4), 467\u2013476 (2004)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"2","key":"844_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:JOGO.0000042112.72379.e6","volume":"29","author":"CA Meyer","year":"2004","unstructured":"Meyer, C.A., Floudas, C.A.: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes. J. Global Optim. 29(2), 125\u2013155 (2004)","journal-title":"J. Global Optim."},{"key":"844_CR9","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.endm.2010.05.102","volume":"36","author":"P Belotti","year":"2010","unstructured":"Belotti, P., Miller, A.J., Namazifar, M.: Valid inequalities and convex hulls for multilinear functions. Electron. Notes Discret. Math. 36, 805\u2013812 (2010)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"844_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-014-0073-z","volume":"7","author":"X Bao","year":"2015","unstructured":"Bao, X., Khajavirad, A., Sahinidis, N.V., Tawarmalani, M.: Global optimization of nonconvex problems with multilinear intermediates. Math. Program. Comput. 7(1), 1\u201337 (2015)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"844_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/10556788.2014.916287","volume":"30","author":"R Misener","year":"2015","unstructured":"Misener, R., Smadbeck, J.B., Floudas, C.A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into glomiqo 2. Optim. Methods Softw. 30(1), 215\u2013249 (2015)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"844_CR12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"A Del Pia","year":"2016","unstructured":"Del Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Op. Res. 42(2), 389\u2013410 (2016)","journal-title":"Math. Op. Res."},{"issue":"1","key":"844_CR13","first-page":"245","volume":"22","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Mathematica Vietnamica 22(1), 245\u2013270 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"issue":"4","key":"844_CR14","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). \nhttps:\/\/doi.org\/10.1023\/A:1008217604285","journal-title":"J. Global Optim."},{"issue":"2","key":"844_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Program. 103(2), 207\u2013224 (2005)","journal-title":"Math. Program."},{"key":"844_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer Science & Business Media, Berlin (2002)"},{"key":"844_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0581-4","volume":"138","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Richard, J.P.P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138, 1\u201347 (2013)","journal-title":"Math. Program."},{"key":"844_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization, vol. 110. Springer, Berlin (2016)"},{"issue":"4","key":"844_CR19","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10898-016-0443-3","volume":"67","author":"C Buchheim","year":"2017","unstructured":"Buchheim, C., D\u2019Ambrosio, C.: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. J. Global Optim. 67(4), 759\u2013786 (2017)","journal-title":"J. Global Optim."},{"key":"844_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.disopt.2017.02.001","volume":"25","author":"Y Crama","year":"2017","unstructured":"Crama, Y., Rodr\u00edguez-Heck, E.: A class of valid inequalities for multilinear 0\u20131 optimization problems. Discret. Optim. 25, 28\u201347 (2017)","journal-title":"Discret. Optim."},{"key":"844_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-018-1246-8","volume":"175","author":"W Adams","year":"2018","unstructured":"Adams, W., Gupte, A., Xu, Y.: Error bounds for monomial convexification in polynomial optimization. Math. Program. 175, 355\u2013393 (2018)","journal-title":"Math. Program."},{"key":"844_CR22","unstructured":"Gupte, A., Kalinowski, T., Rigterink, F., Waterer, H.: Extended formulations for convex hulls of graphs of bilinear functions. arXiv preprint \narXiv:1702.04813\n\n (2017)"},{"key":"844_CR23","unstructured":"Nguyen, T.T., Richard, J.-P.P., Tawarmalani, M.: Deriving the convex hull of a polynomial partitioning set through lifting and projection. Technical report, working paper (2013)"},{"key":"844_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T., Tawarmalani, M., Richard, J.-P.P.: Convexification techniques for linear complementarity constraints. In IPCO, volume 6655, pp. 336\u2013348. Springer (2011)","DOI":"10.1007\/978-3-642-20807-2_27"},{"issue":"1","key":"844_CR25","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10107-010-0374-6","volume":"124","author":"M Tawarmalani","year":"2010","unstructured":"Tawarmalani, M., Richard, J.-P.P., Chung, K.: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124(1), 481\u2013512 (2010)","journal-title":"Math. Program."},{"key":"844_CR26","unstructured":"Gupte, Akshay: Mixed integer bilinear programming with applications to the pooling problem. Ph.D. thesis, Georgia Institute of Technology (2011)"},{"issue":"4","key":"844_CR27","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s12532-018-0150-9","volume":"10","author":"B Kocuk","year":"2018","unstructured":"Kocuk, B., Dey, S.S., Sun, X.A.: Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem. Math. Program. Comput. 10(4), 557\u2013596 (2018)","journal-title":"Math. Program. Comput."},{"key":"844_CR28","unstructured":"Rahman, H., Mahajan, A.: Facets of a mixed-integer bilinear covering set with bounds on variables. arXiv preprint \narXiv:1707.06712\n\n (2017)"},{"issue":"3","key":"844_CR29","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1137\/16M1066166","volume":"27","author":"D Davarnia","year":"2017","unstructured":"Davarnia, D., Richard, J.-P.P., Tawarmalani, M.: Simultaneous convexification of bilinear functions over polytopes with application to network interdiction. SIAM J. Optim. 27(3), 1801\u20131833 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"844_CR30","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TPWRS.2017.2712697","volume":"33","author":"O Li","year":"2018","unstructured":"Li, O., Vittal, V.: Convex hull of the quadratic branch AC power flow equations and its application in radial distribution networks. IEEE Trans. Power Syst. 33(1), 839\u2013850 (2018). \nhttps:\/\/doi.org\/10.1109\/TPWRS.2017.2712697","journal-title":"IEEE Trans. Power Syst."},{"key":"844_CR31","doi-asserted-by":"publisher","unstructured":"Burer S., K\u0131l\u0131n\u00e7-Karzan, F.: How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162(1):393\u2013429 (2017). \nhttps:\/\/doi.org\/10.1007\/s10107-016-1045-z","DOI":"10.1007\/s10107-016-1045-z"},{"issue":"1\u20132","key":"844_CR32","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-016-1084-5","volume":"164","author":"S Modaresi","year":"2017","unstructured":"Modaresi, S., Vielma, J.P.: Convex hull of two quadratic or a conic quadratic and a quadratic inequality. Math. Program. 164(1\u20132), 383\u2013409 (2017)","journal-title":"Math. Program."},{"key":"844_CR33","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11081-018-9402-9","volume":"20","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Santana, A., Wang, Y.: New SOCP relaxation and branching rule for bipartite bilinear programs. Optim. Eng. 20, 307\u2013336 (2018)","journal-title":"Optim. Eng."},{"issue":"2","key":"844_CR34","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/080729529","volume":"20","author":"S Burer","year":"2009","unstructured":"Burer, S., Letchford, A.N.: On nonconvex quadratic programming with box constraints. SIAM J. Optim. 20(2), 1073\u20131089 (2009). \nhttps:\/\/doi.org\/10.1137\/080729529","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"844_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1\u20133), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"844_CR36","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\u2013convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"844_CR37","doi-asserted-by":"publisher","unstructured":"Bonami, P., G\u00fcnl\u00fck, O., Linderoth, J.: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput., 10(3), 333\u2013382 (2018). ISSN 1867\u20132957. \nhttps:\/\/doi.org\/10.1007\/s12532-018-0133-x","DOI":"10.1007\/s12532-018-0133-x"},{"key":"844_CR38","unstructured":"Bienstock, D., Chen, C., Munoz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. arXiv preprint \narXiv:1610.04604\n\n (2016)"},{"key":"844_CR39","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1111237.1111238","volume":"25","author":"CA Haverly","year":"1978","unstructured":"Haverly, C.A.: Studies of the behavior of recursion for the pooling problem. ACM sigmap Bull. 25, 19\u201328 (1978)","journal-title":"ACM sigmap Bull."},{"key":"844_CR40","doi-asserted-by":"publisher","unstructured":"Gupte, A., Ahmed, Shabbir, D., Santanu\u00a0S., Cheon, M.S.: Relaxations and discretizations for the pooling problem. J. Global Optim. 67(3), 631\u2013669 (2017). ISSN 1573-2916. \nhttps:\/\/doi.org\/10.1007\/s10898-016-0434-4","DOI":"10.1007\/s10898-016-0434-4"},{"key":"844_CR41","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"844_CR42","unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. arXiv preprint \narXiv:1812.10160\n\n (2018)"},{"key":"844_CR43","doi-asserted-by":"publisher","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. Computers and Chemical Engineering, 35(5), 876\u2013892, 2011. ISSN 0098-1354. \nhttps:\/\/doi.org\/10.1016\/j.compchemeng.2011.01.026\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0098135411000366\n\n. Selected Papers from ESCAPE-20 (European Symposium of Computer Aided Process Engineering - 20), 6\u20139 June (2010), Ischia, Italy","DOI":"10.1016\/j.compchemeng.2011.01.026"},{"issue":"2","key":"844_CR44","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1287\/opre.2015.1357","volume":"63","author":"SS Dey","year":"2015","unstructured":"Dey, S.S., Gupte, A.: Analysis of MILP techniques for the pooling problem. Oper. Res. 63(2), 412\u2013427 (2015). \nhttps:\/\/doi.org\/10.1287\/opre.2015.1357","journal-title":"Oper. Res."},{"issue":"3","key":"844_CR45","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10898-012-9890-7","volume":"56","author":"M Alfaki","year":"2013","unstructured":"Alfaki, M., Haugland, D.: A multi-commodity flow formulation for the generalized pooling problem. J. Global Optim. 56(3), 917\u2013937 (2013a)","journal-title":"J. Global Optim."},{"issue":"3","key":"844_CR46","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1007\/s10898-012-9875-6","volume":"56","author":"M Alfaki","year":"2013","unstructured":"Alfaki, M., Haugland, D.: Strong formulations for the pooling problem. J. Global Optim. 56(3), 897\u2013916 (2013b)","journal-title":"J. Global Optim."},{"issue":"2","key":"844_CR47","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10898-015-0335-y","volume":"64","author":"D Haugland","year":"2016","unstructured":"Haugland, D.: The computational complexity of the pooling problem. J. Global Optim. 64(2), 199\u2013215 (2016)","journal-title":"J. Global Optim."},{"key":"844_CR48","unstructured":"Luedtke, J., D\u2019Ambrosio, C., Linderoth, J., Schweiger, J.: Strong convex nonlinear relaxations of the pooling problem. arXiv preprint \narXiv:1803.02955\n\n (2018)"},{"issue":"2","key":"844_CR49","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10957-016-0890-5","volume":"170","author":"D Haugland","year":"2016","unstructured":"Haugland, D., Hendrix, E.M.T.: Pooling problems with polynomial-time algorithms. J. Optim. Theory Appl. 170(2), 591\u2013615 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"844_CR50","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10898-016-0432-6","volume":"67","author":"N Boland","year":"2017","unstructured":"Boland, N., Kalinowski, T., Rigterink, F.: A polynomially solvable case of the pooling problem. J. Global Optim. 67(3), 621\u2013630 (2017)","journal-title":"J. Global Optim."},{"issue":"4","key":"844_CR51","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10898-017-0577-y","volume":"71","author":"R Baltean-Lugojan","year":"2018","unstructured":"Baltean-Lugojan, R., Misener, R.: Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness. J. Global Optim. 71(4), 655\u2013690 (2018)","journal-title":"J. Global Optim."},{"issue":"5","key":"844_CR52","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1021\/ie980666q","volume":"38","author":"N Adhya","year":"1999","unstructured":"Adhya, N., Tawarmalani, M., Sahinidis, N.V.: A Lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38(5), 1956\u20131972 (1999)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"4","key":"844_CR53","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10898-016-0404-x","volume":"66","author":"N Boland","year":"2016","unstructured":"Boland, N., Kalinowski, T., Rigterink, F.: New multi-commodity flow formulations for the pooling problem. J. Global Optim. 66(4), 669\u2013710 (2016)","journal-title":"J. Global Optim."},{"key":"844_CR54","unstructured":"Boland, N., Kalinowski, T., Rigterink, F., Savelsbergh, M.: A special case of the generalized pooling problem arising in the mining industry. Preprint at \nhttp:\/\/www.optimization-online.org\/DB_HTML\/2015\/07\/5025.html\n\n (2015)"},{"issue":"1","key":"844_CR55","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10479-017-2407-5","volume":"265","author":"A Marandi","year":"2018","unstructured":"Marandi, A., Dahl, J., de Klerk, E.: A numerical evaluation of the bounded degree sum-of-squares hierarchy of lasserre, toh, and yang on the pooling problem. Ann. Oper. Res. 265(1), 67\u201392 (2018)","journal-title":"Ann. Oper. Res."},{"key":"844_CR56","unstructured":"Misener, R., Floudas, C.A.: GloMIQO 2.2 test suite (ares.tamu.edu\/glomiqo\/test\\_suite.html) (2015)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00844-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00844-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00844-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T23:26:10Z","timestamp":1603236370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00844-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["844"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00844-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"2 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}