We describe an improved technique for handling large numbers of cutting planes when
using an interior-point method for the solution of linear or semidefinite relaxations in binary
quadratic optimization. The approach does not require solving successive relaxations to
optimality but chooses cuts at intermediate iterates based on indicators of inequality
violation and feasibility of their slacks, which are initialized using a recently proposed
warmstart technique without any additional correction steps. Computational tests on …