| Article ID: | iaor20001185 |
| Country: | Netherlands |
| Volume: | 82 |
| Issue: | 3 |
| Start Page Number: | 291 |
| End Page Number: | 315 |
| Publication Date: | Aug 1998 |
| Journal: | Mathematical Programming |
| Authors: | Rendl Franz, Helmberg Christoph |
| Keywords: | programming: convex, programming: branch and bound |
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 us to solve many moderately sized problems, having say, less than 100 binary variables, in a routine manner.