Extending the QCR method to general mixed-integer programs

A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Linear transformation based solution methods for non-convex mixed integer quadratic programs

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

An approximation algorithm for indefinite mixed integer quadratic programming