5 citations · 5 across the 2 of their papers we have counts for
4 papers · 1 filter
An oracle-based framework for robust combinatorial optimization
Enrico Bettiol, Christoph Buchheim, Marianna De Santis +1
We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario ca…
On the Complexity of Robust Bilevel Optimization With Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Felix Hommelsheim
We investigate the complexity of bilevel combinatorial optimization with uncertainty in the follower's objective, in a robust optimization approach. We show that the robust counter…
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…
An Active Set Algorithm for Robust Combinatorial Optimization Based on Separation Oracles
Christoph Buchheim, Marianna De Santis
We address combinatorial optimization problems with uncertain coefficients varying over ellipsoidal uncertainty sets. The robust counterpart of such a problem can be rewritten as a…