{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:43:38Z","timestamp":1769928218667,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_24","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T15:12:23Z","timestamp":1471878743000},"page":"369-387","source":"Crossref","is-referenced-by-count":44,"title":["Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning"],"prefix":"10.1007","author":[{"given":"Harsha","family":"Nagarajan","sequence":"first","affiliation":[]},{"given":"Mowen","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Emre","family":"Yamangil","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Bent","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"24_CR1","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: On feasibility based bounds tightening (2012). https:\/\/hal.archives-ouvertes.fr\/file\/index\/docid\/935464\/filename\/377.pdf"},{"issue":"3","key":"24_CR2","doi-asserted-by":"crossref","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":"1","key":"24_CR3","doi-asserted-by":"crossref","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\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"24_CR4","doi-asserted-by":"crossref","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. Global Optim. 47(4), 661\u2013685 (2010)","journal-title":"J. Global Optim."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Castro, P.M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems. J. Global Optim., 1\u201320 (2015)","DOI":"10.1007\/s10898-015-0342-z"},{"key":"24_CR6","doi-asserted-by":"crossref","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."},{"issue":"2\u20133","key":"24_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10898-014-0162-6","volume":"59","author":"PM Castro","year":"2014","unstructured":"Castro, P.M., Grossmann, I.E.: Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems. J. Global Optim. 59(2\u20133), 277\u2013306 (2014)","journal-title":"J. Global Optim."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-319-23219-5_4","volume-title":"Principles and Practice of Constraint Programming","author":"C Coffrin","year":"2015","unstructured":"Coffrin, C., Hijazi, H.L., Van Hentenryck, P.: Strengthening convex relaxations with bound tightening for power network optimization. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 39\u201357. Springer, Heidelberg (2015)"},{"issue":"3","key":"24_CR9","doi-asserted-by":"crossref","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":"9","key":"24_CR10","doi-asserted-by":"crossref","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":"24_CR11","doi-asserted-by":"crossref","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":"1","key":"24_CR12","doi-asserted-by":"crossref","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."},{"issue":"2","key":"24_CR13","first-page":"150","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4(2), 150\u2013194 (2013)","journal-title":"Int. J. Math. Model. Numer. Optim."},{"issue":"4","key":"24_CR14","doi-asserted-by":"crossref","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."},{"key":"24_CR15","doi-asserted-by":"crossref","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":"1","key":"24_CR16","doi-asserted-by":"crossref","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."},{"issue":"1","key":"24_CR17","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(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"3","key":"24_CR18","doi-asserted-by":"crossref","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":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-642-01929-6_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S Mouret","year":"2009","unstructured":"Mouret, S., Grossmann, I.E., Pestiaux, P.: Tightening the linear relaxation of a mixed integer nonlinear program using constraint programming. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 208\u2013222. Springer, Heidelberg (2009)"},{"issue":"5","key":"24_CR20","doi-asserted-by":"crossref","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":"2","key":"24_CR21","doi-asserted-by":"crossref","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. Global Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"issue":"4","key":"24_CR22","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EM Smith","year":"1999","unstructured":"Smith, E.M., Pantelides, C.C.: A symbolic reformulation\/spatial B&B algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23(4), 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"24_CR23","doi-asserted-by":"crossref","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":"24_CR24","doi-asserted-by":"crossref","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":"4","key":"24_CR25","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T21:12:45Z","timestamp":1568322765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}