The multilinear polytope of beta-acyclic hypergraphs has polynomial extension complexity Published: 2022/12/15 Alberto Del PiaAida KhajaviradCategories 0-1 Programming, Global Optimization Theory, Integer Programming Tags binary polynomial optimization, hypergraph acyclicity, multilinear polytope, polynomial-size extended formulation Short URL: https://optimization-online.org/?p=21308 Article Download View The multilinear polytope of beta-acyclic hypergraphs has polynomial extension complexity