| Article ID: | iaor1994718 |
| Country: | Netherlands |
| Volume: | 13 |
| Issue: | 2 |
| Start Page Number: | 99 |
| End Page Number: | 105 |
| Publication Date: | Mar 1993 |
| Journal: | Operations Research Letters |
| Authors: | Baldick Ross |
| Keywords: | programming: quadratic |
Barahona described a linear time algorithm for a class of 0-1 quadratic programming problems. The algorithm was based on a transformation to a max-cut problem. The paper describes a linear algorithm that treats a slightly more general problem directly in its original form. It then gives a pseudopolynomial algorithm for even more general problems.