@article{Wu_Zhang_2018, title={Improved SDP Bounds for Binary Quadratic Programming}, volume={4}, url={http://www.rajournals.in/index.php/rajar/article/view/25}, DOI={10.31142/rajar/v4i6.09}, abstractNote={<p>As a classical combinatorial problem, the binary quadratic programming problem has many applications in finance, statistics, production management, etc. The state-of-the-art solution for solving this problem accurately is based on branch-and-bound frameworks, with the low bound support of a semi-definite programming (SDP) relaxation. This paper generalizes the spectral bounds in the literature and proposes a sequence of improved SDP bounds for the binary quadratic programming problem. Our method relies on the closest binary points to an affine space, which can be found by reverse enumeration technique.</p>}, number={06}, journal={RA Journal Of Applied Research}, author={Wu, Baiyi and Zhang, Qun}, year={2018}, month={Jun.}, pages={1785–1791} }