3 papers
math.OC2026
The complete edge relaxation for binary polynomial optimization
Alberto Del Pia, Aida Khajavirad
We consider the multilinear polytope, defined as the convex hull of the feasible region of a lifted binary polynomial optimization problem. We define a relaxation in an extended sp…
math.OC2025
Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
Alberto Del Pia, Aida Khajavirad
In this paper, we study the problem of minimizing a polynomial function with literals over all binary points, often referred to as pseudo-Boolean optimization. We investigate the f…
math.OC2025
Extended formulations for the multilinear polytope of acyclic hypergraphs
Alberto Del Pia, Aida Khajavirad
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible re…