{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:17:19Z","timestamp":1764364639958,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_2","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"14-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Separation of\u00a0RLT Cuts for\u00a0Implicit and\u00a0Explicit Bilinear Products"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7018-7099","authenticated-orcid":false,"given":"Ksenia","family":"Bestuzheva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0862-7065","authenticated-orcid":false,"given":"Tobias","family":"Achterberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"issue":"10","key":"2_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":"2_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":"2_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."},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Bestuzheva, K., et al.: Enabling research through the SCIP optimization suite 8.0. ACM Trans. Math. Softw. (2023). https:\/\/doi.org\/10.1145\/3585516","DOI":"10.1145\/3585516"},{"issue":"1","key":"2_CR5","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":"2_CR6","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 - a 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."},{"issue":"1","key":"2_CR7","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":"3","key":"2_CR8","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":"2_CR9","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":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th\u00a0mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"2_CR11","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"issue":"1","key":"2_CR12","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":"2_CR13","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":"2_CR14","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. Global Optim. 33(2), 157\u2013196 (2005)","journal-title":"J. Global Optim."},{"key":"2_CR15","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 Programm. Theory Practice 3, 253\u2013303 (2005)","journal-title":"Integer Programm. Theory Practice"},{"issue":"1","key":"2_CR16","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 - convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"2_CR17","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":"3","key":"2_CR18","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":"2_CR19","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":"2_CR20","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":"2_CR21","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. Global Optim. 2(4), 379\u2013410 (1992)","journal-title":"J. Global Optim."},{"issue":"3","key":"2_CR22","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. Global Optim. 52(3), 447\u2013469 (2012)","journal-title":"J. Global Optim."},{"issue":"1\u20133","key":"2_CR23","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":"2_CR24","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. Global Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Global Optim."},{"issue":"1","key":"2_CR25","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."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:57Z","timestamp":1684700937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}