Andreas Bärmann

23 papers A* 1Journal 21Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport.
EURO J. Transp. Logist.
Andreas Bärmann, Alexander Martin, Jonasz Staszek
2024 J jnl
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I.
Comput. Optim. Appl.
Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand
2024 J jnl
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II.
Comput. Optim. Appl.
Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager, Robert Hildebrand
2023 J jnl
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph.
Discret. Appl. Math.
Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez
2023 J jnl
An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products.
J. Optim. Theory Appl.
Andreas Bärmann, Robert Burlacu, Lukas Hager, Katja Kutzer
2023 J jnl
Data-Driven Distributionally Robust Optimization over Time.
INFORMS J. Optim.
Kevin-Martin Aigner, Andreas Bärmann, Kristin Braun, Frauke Liers, Sebastian Pokutta, Oskar Schneider, Kartikey Sharma, Sebastian Tschuppik
2023 J jnl
EETTlib - Energy-efficient train timetabling library.
Networks
Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider
2023 J jnl
Improving Quantum Computation by Optimized Qubit Routing.
J. Optim. Theory Appl.
Friedrich Wagner, Andreas Bärmann, Frauke Liers, Markus Weissenbäck
2023 J jnl
On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations.
J. Glob. Optim.
Andreas Bärmann, Robert Burlacu, Lukas Hager, Thomas Kleinert
2023 J jnl
The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints.
SIAM J. Optim.
Andreas Bärmann, Alexander Martin, Oskar Schneider
2022 J jnl
On Recognizing Staircase Compatibility.
J. Optim. Theory Appl.
Andreas Bärmann, Patrick Gemander, Alexander Martin, Maximilian Merkert
2022 J jnl
Set characterizations and convex extensions for geometric convex-hull proofs.
Math. Program.
Andreas Bärmann, Oskar Schneider
2021 J jnl
Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling.
Transp. Sci.
Andreas Bärmann, Alexander Martin, Oskar Schneider
2020 J jnl
The clique problem with multiple-choice constraints under a cycle-free dependency graph.
Discret. Appl. Math.
Andreas Bärmann, Patrick Gemander, Maximilian Merkert
2018 J jnl
An Online-Learning Approach to Inverse Optimization.
CoRR
Andreas Bärmann, Alexander Martin, Sebastian Pokutta, Oskar Schneider
2018 J jnl
Staircase compatibility and its applications in scheduling and piecewise linearization.
Discret. Optim.
Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert, Oskar Schneider
2017 J jnl
A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany.
Transp. Sci.
Andreas Bärmann, Alexander Martin, Hanno Schülldorf
2017 J jnl
A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation.
Public Transp.
Andreas Bärmann, Alexander Martin, Oskar Schneider
2017 A* conf
Emulating the Expert: Inverse Optimization through Online Learning.
ICML
Andreas Bärmann, Sebastian Pokutta, Oskar Schneider
2017 J jnl
Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci.
Andreas Bärmann, Andreas Heidt, Alexander Martin, Sebastian Pokutta, Christoph Thurner
2016 — conf
An Optimal Expansion Strategy for the German Railway Network Until 2030.
OR
Andreas Bärmann
2016 J jnl
Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study.
Comput. Manag. Sci.
Andreas Bärmann, Andreas Heidt, Alexander Martin, Sebastian Pokutta, Christoph Thurner
2015 J jnl
Solving network design problems via iterative aggregation.
Math. Program. Comput.
Andreas Bärmann, Frauke Liers, Alexander Martin, Maximilian Merkert, Christoph Thurner, Dieter Weninger