1 paper
Hao Hu, Boshi Yang
Semidefinite programming (SDP) relaxations can provide strong bounds for binary and mixed-binary optimization problems, but their practical use is often limited by matrix variables…