5 citations · 5 across the 2 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
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…
math.OC2016
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
We present a coordinate ascent method for a class of semidefinite programming problems that arise in non-convex quadratic integer optimization. These semidefinite programs are char…