On the membership problem for the {0,1/2}-closure

► Zero-half cuts are a class of cutting planes for integer programming problems. ► They form a subclass of the well-known Gomory-Chvátal cuts. ► To use them computationally, a separation algorithm is needed. ► It is known that the separation problem is NP-hard in general. ► We show that it remains NP-hard even when all variables are binary.