| Article ID: | iaor2003799 |
| Country: | Germany |
| Volume: | 91 |
| Issue: | 1 |
| Start Page Number: | 49 |
| End Page Number: | 52 |
| Publication Date: | Jan 2001 |
| Journal: | Mathematical Programming |
| Authors: | Fukuda K., Liebling T.M., Allemand K., Steiner E. |
Unconstrained zero–one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known spectral decomposition.