Allemand, KimFukuda, KomeiLiebling, Thomas M.Steiner, Erich2006-02-132006-02-132006-02-13200110.1007/s101070100233https://infoscience.epfl.ch/handle/20.500.14299/222956Unconstrained 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.A polynomial case of inconstrained zero-one queadratic optimizationtext::journal::journal article::research article