{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:14:19Z","timestamp":1781284459781,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T00:00:00Z","timestamp":1677369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T00:00:00Z","timestamp":1677369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CBET-2026980"],"award-info":[{"award-number":["CBET-2026980"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11590-023-01985-y","type":"journal-article","created":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T15:02:22Z","timestamp":1677423742000},"page":"215-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9286-832X","authenticated-orcid":false,"given":"Yifu","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos T.","family":"Maravelias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaomin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,26]]},"reference":[{"issue":"3","key":"1985_CR1","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. Glob. Optim. 56(3), 897\u2013916 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9875-6","journal-title":"J. Glob. Optim."},{"key":"1985_CR2","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/S10898-021-01046-7","volume":"80","author":"KM Anstreicher","year":"2021","unstructured":"Anstreicher, K.M., Burer, S., Park, K.: Convex hull representations for bounded products of variables. J. Glob. Optim. 80, 757\u2013778 (2021). https:\/\/doi.org\/10.1007\/S10898-021-01046-7","journal-title":"J. Glob. Optim."},{"issue":"C","key":"1985_CR3","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(C), 805\u2013812 (2010). https:\/\/doi.org\/10.1016\/j.endm.2010.05.102","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"1985_CR4","first-page":"1","volume":"22","author":"P Belotti","year":"2011","unstructured":"Belotti, P., Miller, A.J., Namazifar, M.: Linear inequalities for bounded products of variables. SIAG\/OPT Views-and-News 22(1), 1\u20138 (2011)","journal-title":"SIAG\/OPT Views-and-News"},{"issue":"1\u20133","key":"1985_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01582066","volume":"63","author":"A Ben-Tal","year":"1994","unstructured":"Ben-Tal, A., Eiger, G., Gershovitz, V.: Global minimization by reducing the duality gap. Math. Program. 63(1\u20133), 193\u2013212 (1994). https:\/\/doi.org\/10.1007\/BF01582066","journal-title":"Math. Program."},{"key":"1985_CR6","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. Glob. Optim. 66, 669\u2013710 (2016). https:\/\/doi.org\/10.1007\/s10898-016-0404-x","journal-title":"J. Glob. Optim."},{"key":"1985_CR7","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). https:\/\/doi.org\/10.1016\/j.compchemeng.2022.107660","journal-title":"Comput. Chem. Eng."},{"key":"1985_CR8","doi-asserted-by":"publisher","unstructured":"Ceccon, F., Misener, R.: Solving the pooling problem at scale with extensible solver galini. Comput. Chem. Eng. 159, 107660 (2022). https:\/\/doi.org\/10.1016\/j.compchemeng.2022.107660","DOI":"10.1016\/j.compchemeng.2022.107660"},{"issue":"3","key":"1985_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10898-020-00882-3","volume":"77","author":"Y Chen","year":"2020","unstructured":"Chen, Y., Maravelias, C.T.: Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization. J. Glob. Optim. 77(3), 603\u2013625 (2020). https:\/\/doi.org\/10.1007\/s10898-020-00882-3","journal-title":"J. Glob. Optim."},{"key":"1985_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/S11081-021-09646-8","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Maravelias, C.T.: Tightening methods based on nontrivial bounds on bilinear terms. Optim. Eng. (2021). https:\/\/doi.org\/10.1007\/S11081-021-09646-8","journal-title":"Optim. Eng."},{"key":"1985_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-20807-2_10","volume-title":"Integer Programming and Combinatoral Optimization","author":"C D\u2019Ambrosio","year":"2011","unstructured":"D\u2019Ambrosio, C., Linderoth, J., Luedtke, J.: Valid inequalities for the pooling problem with binary variables. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatoral Optimization, pp. 117\u2013129. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"issue":"2","key":"1985_CR12","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). https:\/\/doi.org\/10.1287\/opre.2015.1357","journal-title":"Oper. Res."},{"key":"1985_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/S10898-019-00844-4\/TABLES\/18","volume":"77","author":"SS Dey","year":"2020","unstructured":"Dey, S.S., Kocuk, B., Santana, A.: Convexifications of rank-one-based substructures in qcqps and applications to the pooling problem. J. Glob. Optim. 77, 227\u2013272 (2020). https:\/\/doi.org\/10.1007\/S10898-019-00844-4\/TABLES\/18","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1985_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. Ser. B 91(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"1985_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N.V., Vigerske, S., Wiegele, A.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2), 237\u2013265 (2019). https:\/\/doi.org\/10.1007\/s12532-018-0147-4","journal-title":"Math. Program. Comput."},{"issue":"12","key":"1985_CR16","doi-asserted-by":"publisher","first-page":"5742","DOI":"10.1021\/ie8016048","volume":"48","author":"CE Gounaris","year":"2009","unstructured":"Gounaris, C.E., Misener, R., Floudas, C.A.: Computational comparison of Piecewise-Linear relaxations for pooling problems. Ind. Eng. Chem. Res. 48(12), 5742\u20135766 (2009). https:\/\/doi.org\/10.1021\/ie8016048","journal-title":"Ind. Eng. Chem. Res."},{"key":"1985_CR17","unstructured":"Gupte, A.: Mixed integer bilinear programming with applications to the pooling problem. ProQuest Dissertations and Theses (December), 192 (2012), https:\/\/search.proquest.com\/docview\/1288419945?accountid=188395"},{"issue":"2","key":"1985_CR18","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte, A., Ahmed, S., Cheon, M.S., Dey, S.: Solving mixed integer bilinear problems using MILP formulations. SIAM J. Optim. 23(2), 721\u2013744 (2013). https:\/\/doi.org\/10.1137\/110836183","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1985_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-016-0434-4","volume":"67","author":"A Gupte","year":"2017","unstructured":"Gupte, A., Ahmed, S., Dey, S.S., Cheon, M.S.: Relaxations and discretizations for the pooling problem. J. Glob. Optim. 67(3), 631\u2013669 (2017). https:\/\/doi.org\/10.1007\/s10898-016-0434-4","journal-title":"J. Glob. Optim."},{"key":"1985_CR20","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. Glob. Optim. 64, 199\u2013215 (2016). https:\/\/doi.org\/10.1007\/s10898-015-0335-y","journal-title":"J. Glob. Optim."},{"key":"1985_CR21","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). https:\/\/doi.org\/10.1145\/1111237.1111238","journal-title":"ACM SIGMAP Bull."},{"issue":"3","key":"1985_CR22","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-019-00795-w","volume":"75","author":"M Kimizuka","year":"2019","unstructured":"Kimizuka, M., Kim, S., Yamashita, M.: Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods. J. Glob. Optim. 75(3), 631\u2013654 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00795-w","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1985_CR23","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10898-012-0022-1","volume":"57","author":"SP Kolodziej","year":"2013","unstructured":"Kolodziej, S.P., Castro, P.M., Grossmann, I.E.: Global optimization of bilinear programs with a multiparametric disaggregation technique. J. Glob. Optim. 57(4), 1039\u20131063 (2013). https:\/\/doi.org\/10.1007\/s10898-012-0022-1","journal-title":"J. Glob. Optim."},{"key":"1985_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2015.12.017","author":"I Lotero","year":"2016","unstructured":"Lotero, I., Trespalacios, F., Grossmann, I.E., Papageorgiou, D.J., Cheon, M.S.: An MILP-MINLP decomposition method for the global optimization of a source based model of the multiperiod blending problem. Comput. Chem. Eng. (2016). https:\/\/doi.org\/10.1016\/j.compchemeng.2015.12.017","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1985_CR25","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1137\/18M1174374","volume":"30","author":"J Luedtke","year":"2020","unstructured":"Luedtke, J., D\u2019Ambrosio, C., Linderoth, J., Schweiger, J.: Strong convex nonlinear relaxations of the pooling problem. SIAM J. Optim. 30(2), 1582\u20131609 (2020). https:\/\/doi.org\/10.1137\/18M1174374","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1985_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/OPRE.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49(3), 363\u2013371 (2001). https:\/\/doi.org\/10.1287\/OPRE.49.3.363.11211","journal-title":"Oper. Res."},{"issue":"1","key":"1985_CR27","first-page":"3","volume":"8","author":"R Misener","year":"2009","unstructured":"Misener, R., Floudas, C.A.: Advances for the pooling problem: modeling, global optimization, and computational studies survey. Appl. Comput. Math. 8(1), 3\u201322 (2009)","journal-title":"Appl. Comput. Math."},{"issue":"5","key":"1985_CR28","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). https:\/\/doi.org\/10.1016\/j.compchemeng.2011.01.026","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"1985_CR29","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/S10898-018-00734-1","volume":"74","author":"H Nagarajan","year":"2019","unstructured":"Nagarajan, H., Lu, M., Wang, S., Bent, R., Sundar, K.: An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs. J. Glob. Optim. 74(4), 639\u2013675 (2019). https:\/\/doi.org\/10.1007\/S10898-018-00734-1","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1985_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1287\/TRSC.1110.0381","volume":"46","author":"DJ Papageorgiou","year":"2012","unstructured":"Papageorgiou, D.J., Toriello, A., Nemhauser, G.L., Savelsbergh, M.W.: Fixed-charge transportation with product blending. Transp. Sci. 46(2), 281\u2013295 (2012). https:\/\/doi.org\/10.1287\/TRSC.1110.0381","journal-title":"Transp. Sci."},{"key":"1985_CR31","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and global optimization in continuous and mixed-integer nonlinear programming : theory, algorithms, software, and applications. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-1-4757-3532-1"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01985-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01985-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01985-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T06:22:22Z","timestamp":1704867742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01985-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,26]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1985"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01985-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,26]]},"assertion":[{"value":"21 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}