Recursive McCormick relaxations are among the most popular convexification techniques
for binary polynomial optimization. It is well-understood that both the quality and the size of …

This paper revisits the approach of transforming a mixed-integer polynomial program
(MIPOP) into a mixed-integer quadratically-constrained program (MIQCP), in the light of …

We consider the multilinear polytope defined as the convex hull of the set of binary points z,
satisfying a collection of equations of the form ze=∏ v∈ ezv for all e∈ E. The complexity of …

We consider the multilinear polytope which arises naturally in binary polynomial
optimization. Del Pia and Di Gregorio introduced the class of odd β-cycle inequalities valid …

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 …

Abstract Unconstrained Binary Polynomial Programs (UBPs) are a class of optimization
problems relevant in a broad array of fields. In this paper, we examine an example from …

In this work, we advance the understanding of the fundamental limits of computation for
binary polynomial optimization (BPO), which is the problem of maximizing a given …

We consider unconstrained polynomial minimization problems with binary variables (BPO).
These problems can be easily linearized, ie, reformulated into a MILP in a higher …

Recently, several classes of cutting planes have been introduced for binary polynomial
optimization. In this paper, we present the first results connecting the combinatorial structure …

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 …