We investigate in this paper a fixed parameter polynomial algorithm for the cardinality constrained quadratic optimization problem, which is NP-hard in general. More specifically, we prove that, given a problem of size $n$, the number of decision variables, and $s$, the cardinality, if, for some $0

## Citation

Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong, August 2010

## Article

View A polynomial case of cardinality constrained quadratic optimization problem