Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

We present computational experiments for solving quadratic (0, 1) problems. Our approach combines a semidefinite relaxation with a cutting plane technique, and is applied in a Branch and Bound setting. Our experiments indicate that this type of approach is very robust, and allows to solve many moderately sized problems, having say, less than 100 binary variables, in a routine manner. (C) 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.