11 citations · 14 across the 6 of their papers we have counts for
6 papers
Constraint Preserving XY-Mixers under Trotterized Adiabatic Evolution
Abhishek Awasthi, Maximilian Hess, Salome Lomadze +2
Constraint handling is a central challenge for quantum algorithms applied to combinatorial optimization. Standard penalty-based approaches increase problem size, distort energy lan…
On the Relation Between Affinely Adjustable Robust Linear Complementarity and Mixed-Integer Linear Feasibility Problems
Christian Biefel, Martin Schmidt
We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of…
Robust static and dynamic maximum flows
Christian Biefel, Martina Kuchlbauer, Frauke Liers +1
We study the robust maximum flow problem and the robust maximum flow over time problem where a given number of arcs may fail or may be delayed. Two prominent models have been i…
Pareto Robust optimization on Euclidean vector spaces
Dennis Adelhuette, Christian Biefel, Martina Kuchlbauer +1
Pareto efficiency for robust linear programs was introduced by Iancu and Trichakis in [9]. We generalize their approach and theoretical results to robust optimization problems in E…
Robust Market Equilibria under Uncertain Cost
Christian Biefel, Frauke Liers, Jan Rolfes +2
This work studies equilibrium problems under uncertainty where firms maximize their profits in a robust way when selling their output. Robust optimization plays an increasingly imp…
Affinely Adjustable Robust Linear Complementarity Problems
Christian Biefel, Frauke Liers, Jan Rolfes +1
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics lik…