Solving Quadratic (0,1)-Problems by Semidefinite Programs and Cutting Planes

Franz Rendl and Christoph Helmberg

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.

Other reports of the ZIB are available.

Preprint SC-95-35 of the Konrad-Zuse-Zentrum fuer Informationstechnik Berlin.


 [POSTSCRIPT]  [IP PAGE]  [SEARCH AGAIN]