3 papers
math.OC2021
Set characterizations and convex extensions for geometric convex-hull proofs
Andreas Bärmann, Oskar Schneider
In the present work, we consider Zuckerberg's method for geometric convex-hull proofs introduced in [Geometric proofs for convex hull defining formulations, Operations Research Let…
math.OC2020
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
Andreas Bärmann, Alexander Martin, Oskar Schneider
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hu…
math.OC2018
An Online-Learning Approach to Inverse Optimization
Andreas Bärmann, Alexander Martin, Sebastian Pokutta +1
In this paper, we demonstrate how to learn the objective function of a decision-maker while only observing the problem input data and the decision-maker's corresponding decisions o…