Solving Network Design Problems via Decomposition, Aggregation and Approximation

1. Introduction
Andreas Bärmann

Part I. Decomposition Algorithms for Multi-Period Network Design

2. Motivation
Andreas Bärmann

3. Strategic Infrastructure Planning in Railway Networks
Andreas Bärmann

4. Modelling the Expansion Problem
Andreas Bärmann

5. Model Analysis and Solution Approaches
Andreas Bärmann

6. Case Study for the German Railway Network
Andreas Bärmann

Part II. Iterative Aggregation Procedures for Network Design Problems

7. Motivation
Andreas Bärmann

8. An Iterative Aggregation Algorithm for Optimal Network Design
Andreas Bärmann

9. Integration of Routing Costs into the Aggregation Scheme
Andreas Bärmann

10. The Computational Impact of Aggregation
Andreas Bärmann

Part III. Approximate Second-Order Cone Robust Optimization

11. Motivation
Andreas Bärmann

12. Polyhedral Approximation of Second-Order Cone Robust Counterparts
Andreas Bärmann

13. Computational Assessment of Approximate Robust Optimization
Andreas Bärmann

14. Conclusions and Outlook
Andreas Bärmann

Keywords: Mathematics, Optimization, Operation Research/Decision Theory, Logistics