most citedSDP-based branch-and-bound for non-convex quadratic integer optimization

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

math.OC2019★ 5 cited

SDP-based branch-and-bound for non-convex quadratic integer optimization

Christoph Buchheim, Maribel Montenegro, Angelika Wiegele

Semidefinite programming (SDP) relaxations have been intensively used for solving discrete quadratic optimization problems, in particular in the binary case. For the general non-co…