24 citations · 39 across the 6 of their papers we have counts for
6 papers
Data-driven Distributionally Robust Optimization over Time
Kevin-Martin Aigner, Andreas Bärmann, Kristin Braun +5
Stochastic Optimization (SO) is a classical approach for optimization under uncertainty that typically requires knowledge about the probability distribution of uncertain parameters…
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part II
Benjamin Beach, Robert Burlacu, Andreas Barmann +2
This is Part II of a study on mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQ…
Enhancements of Discretization Approaches for Non-Convex Mixed-Integer Quadratically Constraint Quadratic Programming: Part I
Benjamin Beach, Robert Burlacu, Andreas Bärmann +2
We study mixed-integer programming (MIP) relaxation techniques for the solution of non convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP r…
Improving Quantum Computation by Optimized Qubit Routing
Friedrich Wagner, Andreas Bärmann, Frauke Liers +1
In this work we propose a high-quality decomposition approach for qubit routing by swap insertion. This optimization problem arises in the context of compiling quantum algorithms o…
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…
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…