Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Problems
Lift-and-Project cuts: an efficient solution method for mixed-integer programs Sebastian Ceria Graduate School of Business and Computational Optimization.
