research article
A polynomial case of inconstrained zero-one queadratic optimization
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.
Type
research article
Author(s)
Date Issued
2001
Published in
Volume
91
Issue
1
Start page
49
End page
52
Note
PRO 01.11
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record