| Article ID: | iaor1989765 |
| Country: | Netherlands |
| Volume: | 44 |
| Issue: | 2 |
| Start Page Number: | 127 |
| End Page Number: | 137 |
| Publication Date: | Jun 1989 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Barahona F., Jnger M., Reinelt G. |
| Keywords: | programming: integer |
The authors present computational experience with a cutting plane algorithm for 0-1 quadratic programming without constraints. The present approach is based on a reduction of this problem to a max-cut problem in a graph and on a partial linear description of the cut polytope.