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.


Published in:
Mathematical Programming, 91, 1, 49-52
Year:
2001
Note:
PRO 01.11
Laboratories:




 Record created 2006-02-13, last modified 2018-12-03

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)