We consider the multilinear polytope which arises naturally in binary polynomial optimization. Del Pia and Di Gregorio introduced class of odd $$\beta $$ -cycle inequalities valid for this polytope, showed that these generally have Chvátal rank 2 with respect to standard relaxation that, together flower inequalities, they yield a perfect formulation cycle hypergraph instances. Moreover, describ...
