Solving network design problems via iterative aggregation. - Andreas Bärmann; Frauke Liers; Alexander Martin 001; Maximilian Merkert; Christoph Thurner; Dieter Weninger (Math. Program. Comput., 2015)

An Optimal Expansion Strategy for the German Railway Network Until 2030. - Andreas Bärmann (OR, 2016)

Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. - Andreas Bärmann; Andreas Heidt; Alexander Martin 001; Sebastian Pokutta; Christoph Thurner (Comput. Manag. Sci., 2016)

Emulating the Expert: Inverse Optimization through Online Learning. - Andreas Bärmann; Sebastian Pokutta; Oskar Schneider (ICML, 2017)

Erratum to: Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study. - Andreas Bärmann; Andreas Heidt; Alexander Martin 001; Sebastian Pokutta; Christoph Thurner (Comput. Manag. Sci., 2017)

A comparison of performance metrics for balancing the power consumption of trains in a railway network by slight timetable adaptation. - Andreas Bärmann; Alexander Martin 001; Oskar Schneider (Public Transp., 2017)

A Decomposition Method for Multiperiod Railway Network Expansion - With a Case Study for Germany. - Andreas Bärmann; Alexander Martin 001; Hanno Schülldorf (Transp. Sci., 2017)

An Online-Learning Approach to Inverse Optimization. - Andreas Bärmann; Alexander Martin 001; Sebastian Pokutta; Oskar Schneider (CoRR, 2018)

Staircase compatibility and its applications in scheduling and piecewise linearization. - Andreas Bärmann; Thorsten Gellermann; Maximilian Merkert; Oskar Schneider (Discret. Optim., 2018)

The clique problem with multiple-choice constraints under a cycle-free dependency graph. - Andreas Bärmann; Patrick Gemander; Maximilian Merkert (Discret. Appl. Math., 2020)

Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling. - Andreas Bärmann; Alexander Martin 001; Oskar Schneider (Transp. Sci., 2021)

On Recognizing Staircase Compatibility. - Andreas Bärmann; Patrick Gemander; Alexander Martin 001; Maximilian Merkert (J. Optim. Theory Appl., 2022)

Set characterizations and convex extensions for geometric convex-hull proofs. - Andreas Bärmann; Oskar Schneider (Math. Program., 2022)

Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. - Andreas Bärmann; Patrick Gemander; Maximilian Merkert; Ann-Kathrin Wiertz; Francisco Javier Zaragoza Martínez (Discret. Appl. Math., 2023)

EETTlib - Energy-efficient train timetabling library. - Andreas Bärmann; Patrick Gemander; Lukas Hager; Frederik Nöth; Oskar Schneider (Networks, 2023)

On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations. - Andreas Bärmann; Robert Burlacu; Lukas Hager; Thomas Kleinert (J. Glob. Optim., 2023)

Improving Quantum Computation by Optimized Qubit Routing. - Friedrich Wagner; Andreas Bärmann; Frauke Liers; Markus Weissenbäck (J. Optim. Theory Appl., 2023)

Data-Driven Distributionally Robust Optimization over Time. - Kevin-Martin Aigner; Andreas Bärmann; Kristin Braun; Frauke Liers; Sebastian Pokutta; Oskar Schneider; Kartikey Sharma; Sebastian Tschuppik (INFORMS J. Optim., 2023)

An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products. - Andreas Bärmann; Robert Burlacu; Lukas Hager; Katja Kutzer (J. Optim. Theory Appl., 2023)

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints. - Andreas Bärmann; Alexander Martin 001; Oskar Schneider (SIAM J. Optim., 2023)

A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport. - Andreas Bärmann; Alexander Martin 001; Jonasz Staszek (EURO J. Transp. Logist., 2024)

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I. - Benjamin Beach; Robert Burlacu; Andreas Bärmann; Lukas Hager; Robert Hildebrand (Comput. Optim. Appl., 2024)

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II. - Benjamin Beach; Robert Burlacu; Andreas Bärmann; Lukas Hager; Robert Hildebrand (Comput. Optim. Appl., 2024)