Vries, Sven de; Perscheid, Bernd - In: Journal of Global Optimization 84 (2022) 3, pp. 591-606
Cutting planes from the Boolean Quadric Polytope can be used to reduce the optimality gap of the NP-hard nonconvex quadratic program with box constraints (BoxQP). It is known that all cuts of the Chvátal–Gomory closure of the Boolean Quadric Polytope are A -odd cycle inequalities. We obtain a...