{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:15:10Z","timestamp":1771035310874,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T00:00:00Z","timestamp":1693180800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T00:00:00Z","timestamp":1693180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-19-1-2322"],"award-info":[{"award-number":["N00014-19-1-2322"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0123"],"award-info":[{"award-number":["FA9550-23-1-0123"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10107-023-02009-4","type":"journal-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T14:03:46Z","timestamp":1693231426000},"page":"269-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs"],"prefix":"10.1007","volume":"207","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8428-3914","authenticated-orcid":false,"given":"Alberto","family":"Del Pia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7097-1676","authenticated-orcid":false,"given":"Aida","family":"Khajavirad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"1\u20133","key":"2009_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"key":"2009_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30, 479\u2013513 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"2009_CR3","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/15M1054079","volume":"28","author":"D Bienstock","year":"2018","unstructured":"Bienstock, D., Munoz, G.: LP formulations for polynomial optimization problems. SIAM J. Optim. 28(2), 1121\u20131150 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2009_CR4","first-page":"54:1","volume":"49","author":"J Brault-Baron","year":"2016","unstructured":"Brault-Baron, J.: Hypergraph acyclicity revisited. ACM Comput. Surv. 49(3), 54:1-54:26 (2016)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"2009_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2018.07.045","volume":"273","author":"C Buchheim","year":"2019","unstructured":"Buchheim, C., Crama, Y., Rodr\u00edguez-Heck, E.: Berge-acyclic multilinear 0\u20131 optimization problems. Eur. J. Oper. Res. 273(1), 102\u2013107 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"2009_CR6","doi-asserted-by":"crossref","unstructured":"Chen, R., Dash, S., G\u00fcnl\u00fck, O.: Cardinality constrained multilinear sets. In: International Symposium on Combinatorial Optimization, pp. 54\u201365. Springer (2020)","DOI":"10.1007\/978-3-030-53262-8_5"},{"key":"2009_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial Optimization: Packing and Covering, CBMS-NSF Regional Conference Series in Applied Mathematics","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G.: Combinatorial Optimization: Packing and Covering, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 74. SIAM, New Delhi (2001)"},{"key":"2009_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for non-linear $$0-1$$ maximization problems. Math. Program. 61, 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"2009_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.disopt.2017.02.001","volume":"25","author":"Y Crama","year":"2017","unstructured":"Crama, Y., Rodr\u00edguez-Heck, E.: A class of valid inequalities for multilinear 0\u20131 optimization problems. Discret. Optim. 25, 28\u201347 (2017)","journal-title":"Discret. Optim."},{"issue":"4","key":"2009_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/ijoo.2019.0049","volume":"3","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Di Gregorio, S.: Chv\u00e1tal rank in binary polynomial optimization. INFORMS J. Optim. 3(4), 315\u2013349 (2021)","journal-title":"INFORMS J. Optim."},{"key":"2009_CR11","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, A., Di\u00a0Gregorio, S.: On the complexity of binary polynomial optimization over acyclic hypergraphs. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2684\u20132699 (2022)","DOI":"10.1137\/1.9781611977073.105"},{"key":"2009_CR12","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, A., Di\u00a0Gregorio, S.: On the complexity of binary polynomial optimization over acyclic hypergraphs. To appear in Algorithmica (2022)","DOI":"10.1137\/1.9781611977073.105"},{"issue":"2","key":"2009_CR13","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)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2009_CR14","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)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2009_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-017-1158-z","volume":"170","author":"A Del Pia","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: On decomposability of multilinear sets. Math. Program. Ser. A 170(2), 387\u2013415 (2018)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"2009_CR16","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1287\/moor.2021.1121","volume":"46","author":"A Del Pia","year":"2021","unstructured":"Del Pia, A., Khajavirad, A.: The running intersection relaxation of the multilinear polytope. Math. Oper. Res. 46(3), 1008\u20131037 (2021)","journal-title":"Math. Oper. Res."},{"key":"2009_CR17","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.: On the impact of running-intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12, 165\u2013191 (2020)","journal-title":"Math. Program. Comput."},{"key":"2009_CR18","doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, A., Walter, M.: Simple odd $$\\beta $$-cycle inequalities for binary polynomial optimization. In: Proceedings of IPCO 2022, Lecture Notes in Computer Science, vol. 13265, pp. 181\u2013194. Springer (2022)","DOI":"10.1007\/978-3-031-06901-7_14"},{"key":"2009_CR19","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.ipl.2012.05.005","volume":"112","author":"D Duris","year":"2012","unstructured":"Duris, D.: Some characterizations of $$\\gamma $$ and $$\\beta $$-acyclicity of hypergraphs. Inf. Process. Lett. 112, 617\u2013620 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2009_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM (JACM) 30(3), 514\u2013550 (1983)","journal-title":"J. ACM (JACM)"},{"key":"2009_CR21","unstructured":"Hojny, C., Pfetsch, M., Walter, M.: Integrality of linearizations of polynomials over binary variables using additional monomials. arXiv:1911.06894 (2019)"},{"issue":"2","key":"2009_CR22","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)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2009_CR23","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"key":"2009_CR24","unstructured":"Kim, J., Richard, J.P., Tawarmalani, M.: A reciprocity between tree ensemble optimization and multilinear optimization. Optimization Online. https:\/\/optimization-online.org\/2022\/03\/8828\/ (2022)"},{"issue":"1\u20133","key":"2009_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1\u20133), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"6","key":"2009_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3127497","volume":"64","author":"T Rothvoss","year":"2017","unstructured":"Rothvoss, T.: The matching polytope has exponential extension complexity. J. ACM (JACM) 64(6), 1\u201319 (2017)","journal-title":"J. ACM (JACM)"},{"key":"2009_CR27","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"2009_CR28","unstructured":"Xu, Y., Adams, W., Gupte, A.: Polyhedral analysis of symmetric multilinear polynomials over box constraints. arXiv:2012.06394 (2020)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02009-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02009-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02009-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T15:06:49Z","timestamp":1723043209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02009-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,28]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2009"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02009-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,28]]},"assertion":[{"value":"15 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}