12 citations · 62 across the 15 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 10 cited
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
Christoph Buchheim, Dorothee Henke
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack and the follower chooses an optimal packing according to his own profits, w…
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…