It is well known that, under certain conditions, one can use bit representation to transform both integer
quadratic programs
and mixed-integer bilinear programs into mixed-integer linear programs (MILPs), and thereby render them
easier to solve using standard software packages. We show how to convert a more general family of
mixed-integer quadratic programs to MILPs, and present several families of strong valid linear inequalities
that can be used to strengthen the continuous relaxations of the resulting MILPs
