Solving Network Design Problems via Decomposition, Aggregation and Approximation

  • Andreas Bärmann

Table of contents

  1. Front Matter
    Pages I-XV
  2. Andreas Bärmann
    Pages 1-5
  3. Decomposition Algorithms for Multi-Period Network Design

    1. Front Matter
      Pages 7-9
    2. Andreas Bärmann
      Pages 11-14
    3. Andreas Bärmann
      Pages 49-66
    4. Andreas Bärmann
      Pages 67-84
    5. Andreas Bärmann
      Pages 85-102
  4. Iterative Aggregation Procedures for Network Design Problems

    1. Front Matter
      Pages 103-105
    2. Andreas Bärmann
      Pages 107-109
    3. Andreas Bärmann
      Pages 135-153
  5. Approximate Second-Order Cone Robust Optimization

    1. Front Matter
      Pages 155-156
    2. Andreas Bärmann
      Pages 159-162
    3. Andreas Bärmann
      Pages 189-191
  6. Back Matter
    Pages 193-203

About this book


Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time.

  • Decomposition for Multi-Period Network Design
  • Solving Network Design Problems via Aggregation
  • Approximate Second-Order Cone Robust Optimization
Target Groups
  • Researchers, teachers and students in mathematical optimization and operations research
  • Network planners in the field of logistics and beyond
About the Author
Dr. Andreas Bärmann is currently working as a postdoctoral researcher at the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) at the chair of Economics, Discrete Optimization and Mathematics. His research is focussed on mathematical optimization, especially the optimization of logistic processes.


Discrete Optimization Network Design Decomposition Aggregation Robust Optimization

Authors and affiliations

  • Andreas Bärmann
    • 1
  1. 1.Dept. Mathe/Lehrstu. f. WirtschaftsmatheFAU Erlangen-NürnbergErlangenGermany

Bibliographic information