A polynomial case of unconstrained zero–one quadratic optimization

A polynomial case of unconstrained zero–one quadratic optimization

0.00 Avg rating0 Votes
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: , , ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.