Chvátal rank in binary polynomial optimization
We consider the unconstrained 0-1 polynomial optimization problem where its hypergraph representation contains a beta-cycle. First, we show that almost all known cutting planes for this problem have Chvátal rank 1. We then exploit these inequalities to derive new cutting planes that generally have Chvátal rank 2. This novel class …