{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:25:09Z","timestamp":1770423909553,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"German Federal Ministry of Education and Research","award":["05M14ZAM"],"award-info":[{"award-number":["05M14ZAM"]}]},{"name":"German Federal Ministry of Education and Research","award":["05M20ZBM"],"award-info":[{"award-number":["05M20ZBM"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10107-024-02104-0","type":"journal-article","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T13:02:14Z","timestamp":1721134934000},"page":"47-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient separation of RLT cuts for implicit and explicit bilinear terms"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-7099","authenticated-orcid":false,"given":"Ksenia","family":"Bestuzheva","sequence":"first","affiliation":[]},{"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Achterberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"issue":"10","key":"2104_CR1","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manage. Sci. 32(10), 1274\u20131290 (1986)","journal-title":"Manage. Sci."},{"issue":"2","key":"2104_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"WP Adams","year":"1990","unstructured":"Adams, W.P., Sherali, H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38(2), 217\u2013226 (1990)","journal-title":"Oper. Res."},{"issue":"1","key":"2104_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"WP Adams","year":"1993","unstructured":"Adams, W.P., Sherali, H.D.: Mixed-integer bilinear programming problems. Math. Program. 59(1), 279\u2013305 (1993)","journal-title":"Math. Program."},{"issue":"3","key":"2104_CR4","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"2104_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discret. Appl. Math. 52(1), 83\u2013106 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"2104_CR6","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.dam.2008.03.041","volume":"157","author":"HD Sherali","year":"2009","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0\u20131 and general discrete restrictions. Discret. Appl. Math. 157(6), 1319\u20131333 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"2104_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Glob. Optim. 2(4), 379\u2013410 (1992)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2104_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Glob. Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"issue":"1\u20133","key":"2104_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0166-218X(99)00225-5","volume":"101","author":"HD Sherali","year":"2000","unstructured":"Sherali, H.D., Smith, J.C., Adams, W.P.: Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. Discret. Appl. Math. 101(1\u20133), 247\u2013267 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"2104_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D., Tuncbilek, C.H.: New reformulation linearization\/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1\u20139 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2104_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1111\/j.1475-3995.2004.00438.x","volume":"11","author":"L Liberti","year":"2004","unstructured":"Liberti, L.: Reduction constraints for the global optimization of NLPs. Int. Trans. Oper. Res. 11(1), 33\u201341 (2004)","journal-title":"Int. Trans. Oper. Res."},{"key":"2104_CR12","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Reformulation and convex relaxation techniques for global optimization. Ph.D thesis, Springer (2004)","DOI":"10.1007\/s10288-004-0038-6"},{"issue":"2","key":"2104_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10898-004-0864-2","volume":"33","author":"L Liberti","year":"2005","unstructured":"Liberti, L.: Linearity embedded in nonconvex programs. J. Glob. Optim. 33(2), 157\u2013196 (2005)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2104_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10898-011-9757-3","volume":"52","author":"HD Sherali","year":"2012","unstructured":"Sherali, H.D., Dalkiran, E., Liberti, L.: Reduced RLT representations for nonconvex polynomial programming problems. J. Glob. Optim. 52(3), 447\u2013469 (2012)","journal-title":"J. Glob. Optim."},{"key":"2104_CR15","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Compact linearization for binary quadratic problems. 4OR 5(3), 231\u2013245 (2007)","DOI":"10.1007\/s10288-006-0015-3"},{"key":"2104_CR16","doi-asserted-by":"crossref","unstructured":"Mallach, S.: Compact linearization for binary quadratic problems subject to assignment constraints. 4OR 16, 295\u2013309 (2018)","DOI":"10.1007\/s10288-017-0364-0"},{"key":"2104_CR17","doi-asserted-by":"crossref","unstructured":"Mallach, S.: Inductive linearization for binary quadratic programs with linear constraints. 4OR 4, 549\u2013570 (2021)","DOI":"10.1007\/s10288-020-00460-z"},{"issue":"3","key":"2104_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s12667-012-0056-y","volume":"3","author":"S Frank","year":"2012","unstructured":"Frank, S., Steponavice, I., Rebennack, S.: Optimal power flow: a bibliographic survey I. Energy Syst. 3(3), 221\u2013258 (2012)","journal-title":"Energy Syst."},{"issue":"3","key":"2104_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12667-012-0057-x","volume":"3","author":"S Frank","year":"2012","unstructured":"Frank, S., Steponavice, I., Rebennack, S.: Optimal power flow: a bibliographic survey II. Energy Syst. 3(3), 259\u2013289 (2012)","journal-title":"Energy Syst."},{"issue":"1","key":"2104_CR20","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. Appl. Comput. Math. 8(1), 3\u201322 (2009)","journal-title":"Appl. Comput. Math."},{"issue":"1","key":"2104_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/ijoc.1090.0318","volume":"22","author":"C Buchheim","year":"2010","unstructured":"Buchheim, C., Wiegele, A., Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 22(1), 168\u2013177 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2104_CR22","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.compchemeng.2005.07.012","volume":"30","author":"I Castillo","year":"2005","unstructured":"Castillo, I., Westerlund, J., Emet, S., Westerlund, T.: Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30(1), 54\u201369 (2005)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"2104_CR23","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\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"2104_CR24","unstructured":"Achterberg, T.: Constraint integer programming. Dissertation, Technische Universit\u00e4t Berlin (2007)"},{"key":"2104_CR25","doi-asserted-by":"publisher","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: Enabling research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. (2023). https:\/\/doi.org\/10.1145\/3585516","DOI":"10.1145\/3585516"},{"key":"2104_CR26","doi-asserted-by":"publisher","unstructured":"Bestuzheva, K., Chmiela, A., M\u00fcller, B., Serrano, F., Vigerske, S., Wegscheider, F.: Global optimization of mixed-integer nonlinear programs with SCIP 8. J. Glob. Optim. 1\u201324 (2023). https:\/\/doi.org\/10.1007\/s10898-023-01345-1","DOI":"10.1007\/s10898-023-01345-1"},{"issue":"1","key":"2104_CR27","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\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003). https:\/\/doi.org\/10.1287\/ijoc.15.1.114.15159","journal-title":"INFORMS J. Comput."},{"key":"2104_CR28","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J., L\u00fcbbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D., Shinano, Y.: MIPLIB 2017: data-driven compilation of the 6th Mixed-Integer Programming Library. Math. Program. Comput. 13, 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"2104_CR29","first-page":"253","volume":"3","author":"JT Linderoth","year":"2005","unstructured":"Linderoth, J.T., Ralphs, T.K.: Noncommercial software for mixed-integer linear programming. Integer Program.: Theory Pract. 3, 253\u2013303 (2005)","journal-title":"Integer Program.: Theory Pract."},{"key":"2104_CR30","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02104-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02104-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02104-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T15:53:02Z","timestamp":1740757982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02104-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2104"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02104-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"27 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors confirm that they have no Conflict of interest that are directly or indirectly related to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}