Mathematical Programming: Series A and B
The cut polytope and the Boolean quadric polytope
Discrete Mathematics
Operations Research Letters
Hi-index | 0.00 |
We observe that a new class of facet-defining inequalities for the Boolean quadric polytope, introduced by Sherali et al. [4], can in fact be obtained from a class of facet-defining inequalities for the cut polytope via a well-known linear transformation.