{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:39Z","timestamp":1743049659077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031598340"},{"type":"electronic","value":"9783031598357"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-59835-7_29","type":"book-chapter","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:05:03Z","timestamp":1716275103000},"page":"393-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relaxation Strength for\u00a0Multilinear Optimization: McCormick Strikes Back"],"prefix":"10.1007","author":[{"given":"Emily","family":"Schutte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6615-5983","authenticated-orcid":false,"given":"Matthias","family":"Walter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.sorms.2012.08.001","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17, 97\u2013106 (2012). https:\/\/doi.org\/10.1016\/j.sorms.2012.08.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"29_CR2","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 339\u2013347. Cowles Commission Monograph No. 13. Wiley (1951)"},{"key":"29_CR3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0049","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Di Gregorio, S.: Chv\u00e1tal rank in binary polynomial optimization. INFORMS J. Optim. (2021). https:\/\/doi.org\/10.1287\/ijoo.2019.0049","journal-title":"INFORMS J. Optim."},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"A Del Pia","year":"2017","unstructured":"Del Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42(2), 389\u2013410 (2017). https:\/\/doi.org\/10.1287\/moor.2016.0804","journal-title":"Math. Oper. Res."},{"issue":"2","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/16M1095998","volume":"28","author":"A Del Pia","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: The multilinear polytope for acyclic hypergraphs. SIAM J. Optim. 28(2), 1049\u20131076 (2018). https:\/\/doi.org\/10.1137\/16M1095998","journal-title":"SIAM J. Optim."},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1121","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Khajavirad, A.: The running intersection relaxation of the multilinear polytope. Math. Oper. Res. (2021). https:\/\/doi.org\/10.1287\/moor.2021.1121","journal-title":"Math. Oper. Res."},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-019-00169-z","volume":"12","author":"A Del Pia","year":"2020","unstructured":"Del Pia, A., Khajavirad, A., Sahinidis, N.V.: On the impact of running intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12(2), 165\u2013191 (2020). https:\/\/doi.org\/10.1007\/s12532-019-00169-z","journal-title":"Math. Program. Comput."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-031-06901-7_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Del Pia","year":"2022","unstructured":"Del Pia, A., Walter, M.: Simple odd $$\\beta $$-cycle inequalities for binary polynomial optimization. In: Aardal, K., Sanit\u00e0, L. (eds.) Integer Programming and Combinatorial Optimization, pp. 181\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06901-7_14"},{"key":"29_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01992-y","author":"A Del Pia","year":"2023","unstructured":"Del Pia, A., Walter, M.: Simple odd $$\\beta $$-cycle inequalities for binary polynomial optimization. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01992-y","journal-title":"Math. Program."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Dines, L.L.: Systems of linear inequalities. Ann. Math. 191\u2013199 (1919)","DOI":"10.2307\/1967869"},{"issue":"14","key":"29_CR11","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u2019algebre de boole en recherche op\u00e9rationelle. Revue Fran\u00e7aise de Recherche Op\u00e9rationelle 4(14), 17\u201326 (1960)","journal-title":"Revue Fran\u00e7aise de Recherche Op\u00e9rationelle"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF03006558","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: L\u2019algebre de boole et ses applications en recherche operationnelle. Trabajos de Estadistica 4, 17\u201326 (1960). https:\/\/doi.org\/10.1007\/BF03006558","journal-title":"Trabajos de Estadistica"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Fourier, J.B.J.: Analyse des travaux de i\u2019academie royale des sciences pendant i\u2019annee 1824. Partie mathematique, Histoire de l\u2019Academie Royale des Sciences de l\u2019Institut de France 7, xlvii\u2013lv (1827)","DOI":"10.3406\/minf.1824.1207"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F Glover","year":"1973","unstructured":"Glover, F., Woolsey, E.: Further reduction of zero-one polynomial programming problems to zero-one linear programming problems. Oper. Res. 21(1), 156\u2013161 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.156","journal-title":"Oper. Res."},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22(1), 180\u2013182 (1974). https:\/\/doi.org\/10.1287\/opre.22.1.180","journal-title":"Oper. Res."},{"key":"29_CR16","first-page":"1093","volume":"244","author":"L Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 244, 1093\u20131096 (1979)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.orl.2023.01.009","volume":"51","author":"A Khajavirad","year":"2023","unstructured":"Khajavirad, A.: On the strength of recursive McCormick relaxations for binary polynomial optimization. Oper. Res. Lett. 51(2), 146\u2013152 (2023). https:\/\/doi.org\/10.1016\/j.orl.2023.01.009","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2), 325\u2013351 (2012). https:\/\/doi.org\/10.1007\/s10107-012-0606-z","journal-title":"Math. Program."},{"issue":"1","key":"29_CR19","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 \u2013 convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Program."},{"key":"29_CR20","unstructured":"Motzkin, T.S.: Beitr\u00e4ge zur Theorie der linearen Ungleichungen. Ph.D. thesis, Universit\u00e4t Basel (1936)"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Schutte, E., Walter, M.: Relaxation strength for multilinear optimization: McCormick strikes back. arXiv:2311.08570 (2023)","DOI":"10.1007\/978-3-031-59835-7_29"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93, 247\u2013263 (2002). https:\/\/doi.org\/10.1007\/s10107-002-0308-z","journal-title":"Math. Program."}],"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-59835-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T14:31:42Z","timestamp":1732026702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-59835-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031598340","9783031598357"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-59835-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","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":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco2024.ii.uni.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}