A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
Alberto Del Pia, Aida Khajavirad

TL;DR
This paper presents a polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs, advancing understanding of their geometric structure and computational properties.
Contribution
It provides the first polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs, linking hypergraph acyclicity to polyhedral complexity.
Findings
Polynomial-size extended formulation for beta-acyclic hypergraphs
Characterization of hypergraphs with such formulations
Insights into the facial structure of multilinear polytopes
Abstract
We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the acyclicity degree of the underlying hypergraph. We obtain a polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs, hence characterizing the acyclic hypergraphs for which such a formulation can be constructed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · graph theory and CDMA systems · Polynomial and algebraic computation
