collaborators

1 paper

math.OC2012

The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems

Chuan-Hao Guo, Yan-Qin Bai, Li-Ping Tang

It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be modeled as so called comple…