A polynomial case of inconstrained zero-one queadratic optimization
2001
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.
Details
Title
A polynomial case of inconstrained zero-one queadratic optimization
Author(s)
Allemand, Kim ; Fukuda, Komei ; Liebling, Thomas M. ; Steiner, Erich
Published in
Mathematical Programming
Volume
91
Issue
1
Pages
49-52
Date
2001
Note
PRO 01.11
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-02-13