Università di Pisa eBooks
Bit Representation Can Improve SDP Relaxations of Mixed-Integer Quadratic Programs
Laura Galli, Daniel J. Grainger, Adam N. Letchford
Abstract
A standard trick in integer programming is to replace bounded integer variables with \nbinary variables, using a bit representation. In a previous paper, we showed that this process \ncan be used to improve linear programming relaxations of mixed-integer quadratic \nprograms. In this paper, we show that it can also be used to improve {\\em semidefinite}\\/ \nprogramming relaxations.