Dr. Andreas Bärmann

Universität Erlangen-Nürnberg
Department Mathematik
Lehrstuhl für Wirtschaftsmathematik
Cauerstraße 11
91058 Erlangen

Mail: Andreas.Baermann[at]math.uni-erlangen.de
Phone:+49 (0)9131 85-67159
Office:  344

Research Interests

  • Network Design and Network Expansion
  • Network Aggregation
  • Robust Discrete Optimization
  • Optimization of Railway Networks

Projects

Academic Visits

  • July/August 2012, Opens external link in new windowPurdue University, West Lafayette, Indiana, USA
  • April 2016, Universidad de La Laguna, La Laguna, Tenerife, Spain

Publications

Solving Network Design Problems via Iterative Aggregation
Mathematical Programming Computation, Volume 7, Issue 2, pp. 189-217
A. Bärmann, F. Liers, A. Martin, M. Merkert, C. Thurner and D. Weninger
Preprint available here

Opens external link in new windowPolyhedral Approximation of Ellipsoidal Uncertainty Sets via Extended Formulations - a computational case study -,
Tech. Report. (to appear in Computational Management Science),
A. Bärmann, A. Heidt, A. Martin, S. Pokutta and C. Thurner

Aggregation Methods for Railway Network Design Problems,
Invited book chapter (submitted 2015),
A. Bärmann and F. Liers

Optimal Balancing of the Power Load of Trains in a Railway Network via Timetabling,
Proceedings of the CASPT 2015 conference in Vienna
A. Bärmann, A. Martin, O. Schneider
Staircase Compatibility and its Applications in Scheduling and Piecewise Linearization
Technical Report (submitted 2016)
A. Bärmann, T. Gellermann, M. Merkert, O. Schneider

Talks

  • Planning the Expansion of Railway Networks - A Network Design Problem
    18 May, 2011, SIAM, Darmstadt
  • Planning the Expansion of Railway Networks to Deal with Future Demands
    24 May, 2011, CPAIOR, Berlin
  • A Comparison of Decomposition Methods for the Railway Network Expansion Problem
    2 September, 2011, OR, Zürich
  • Approximate Robust Optimization and Applications in Railway Network Expansion
    23 August, 2012, ISMP, Berlin
  • Solving Network Expansion Problems via Iterative Graph Aggregation
    22 May, 2013, INOC, Teneriffa
  • A Decomposition Method for Multi-Period Network Expansion
    14 July, 2014, IFORS, Barcelona
  • Optimal Investment into the Expansion of Railway Networks – A Case Study for Germany
    16 July, 2015, EWGT, Delft
  • Optimal Balancing of the Power Consumption of Trains in a Railway Network via Timetabling
    21 July, 2015, CASPT, Rotterdam
  • Optimizing the Power Load of Railway Timetables
    3 September, 2015, OR, Wien

Teaching

  • SS 2011, Diskrete Optimierung (Prof. Alexander Martin)
  • WS 2011/2012, Numerical Aspects of Linear and Integer Programming (Prof. Robert Bixby)
  • WS 2012/2013, Numerical Aspects of Linear and Integer Programming (Prof. Robert Bixby)
  • SS 2014, Projektseminar: Nach Energieaspekten optimierte Zugfahrpläne (Prof. Frauke Liers, Prof. Alexander Martin, Prof. Martin Schmidt)
  • WS 2015/2016, Mathematik für Ingenieure E3 (PD Dr. Neuß)

Supervised Bachelor Theses

  • Heuristic Aggregation for the Solution of Network Design Problems in Railway Traffic, 2014
  • Minimization of Peak Power Consumption in Urban Railway Traffic, 2014
  • A Comparison of Models for Optimizing the Power Consumption of Trains in a Railway Network, 2015

Supervised Master Theses

  • Solution of a Capacitated Vehicle Routing Problem via Heuristic Column Generation, 2012
  • Optimization of Indoor Navigation at Munich Airport via an Adaptive Heuristic Dijkstra Algorithm Exploiting Grid Graph Structure, 2012
  • Structural Investigation of Multiple-Choice Polyhedra with Precedence Constraints, 2015