Lower Bound Methods for 0-1 Linear Constrained Quadratic Programming

摘要

Some lower bound methods for 0-1 linear constrained quadratic programming problem are discussed in this paper. Several different dual methods and their relationsliip are analyzed, and a necessary and sufficient condition for zero duality gap is proposed.