This paper studies semidefinite programming (SDP) relaxations for the Boolean Quadratic Programming problem with Generalized Upper Bound constraints (BQP-GUB), which arises in several application ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results