Optimization Online


A polynomial case of cardinality constrained quadratic optimization problem

Jianjun Gao(jjgao***at***se.cuhk.edu.hk)
Duan Li (dli***at***se.cuhk.edu.hk)

Abstract: 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

Keywords: Cardinality constrained quadratic optimization, cell enumeration, nonconvex optimization, fixed parameter polynomial algorithm

Category 1: Global Optimization

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 3: Combinatorial Optimization

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

Download: [PDF]

Entry Submitted: 09/03/2010
Entry Accepted: 09/04/2010
Entry Last Modified: 09/03/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society