The Running Intersection Relaxation of the Multilinear Polytope
The multilinear polytope of a hypergraph is the convex hull of a set of binary points satisfying a collection of multilinear equations. We introduce the running intersection inequalities, a new class of facet-defining inequalities for the multilinear polytope. Accordingly, we define a new polyhedral relaxation of the multilinear polytope, referred to as the running intersection relaxation, and identify conditions under which this relaxation is tight. Namely, we show that for kite-free beta-acyclic hypergraphs, a class that lies between gamma-acyclic and beta-acyclic hypergraphs, the running intersection relaxation coincides with the multilinear polytope and it admits a polynomial size extended formulation.
Keyword(s):
Keyword(s):
1995 ◽
Vol 53
◽
pp. 232-233
1992 ◽
Vol 50
(1)
◽
pp. 540-541
1996 ◽
Vol 54
◽
pp. 160-161
Keyword(s):
Keyword(s):