| No. |
Title |
Author |
Year |
| 1 |
Recoverable Robust Periodic Timetabling |
Grafe, Vera et al. |
2023 |
| 2 |
Delay Management with Integrated Decisions on the Vehicle Circulations |
Grafe, Vera et al. |
2022 |
| 3 |
The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties |
Hoogervorst, Rowan et al. |
2022 |
| 4 |
A Phase I Simplex Method for Finding Feasible Periodic Timetables |
Goerigk, Marc et al. |
2021 |
| 5 |
Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks |
Grafe, Vera et al. |
2021 |
| 6 |
Towards Improved Robustness of Public Transport by a Machine-Learned Oracle |
Müller-Hannemann, Matthias et al. |
2021 |
| 7 |
Cheapest Paths in Public Transport: Properties and Algorithms |
Schöbel, Anita et al. |
2020 |
| 8 |
The Trickle-In Effect: Modeling Passenger Behavior in Delay Management |
Schöbel, Anita et al. |
2019 |
| 9 |
Cost-Minimal Public Transport Planning |
Pätzold, Julius et al. |
2018 |
| 10 |
Robustness as a Third Dimension for Evaluating Public Transport Plans |
Friedrich, Markus et al. |
2018 |
| 11 |
Integrating Passengers' Assignment in Cost-Optimal Line Planning |
Friedrich, Markus et al. |
2017 |
| 12 |
Look-Ahead Approaches for Integrated Planning in Public Transportation |
Pätzold, Julius et al. |
2017 |
| 13 |
Robustness Tests for Public Transport Planning |
Friedrich, Markus et al. |
2017 |
| 14 |
A Matching Approach for Periodic Timetabling |
Pätzold, Julius et al. |
2016 |
| 15 |
Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171) |
Kroon, Leo G. et al. |
2016 |
| 16 |
Integrating Passengers' Routes in Periodic Timetabling: A SAT approach |
Gattermann, Philine et al. |
2016 |
| 17 |
Recoverable Robust Timetable Information |
Goerigk, Marc et al. |
2013 |
| 18 |
The Stop Location Problem with Realistic Traveling Time |
Carrizosa, Emilio et al. |
2013 |
| 19 |
Delay Management including Capacities of Stations |
Dollevoet, Twan et al. |
2011 |
| 20 |
The Price of Robustness in Timetable Information |
Goerigk, Marc et al. |
2011 |
| 21 |
An Empirical Analysis of Robustness Concepts for Timetabling |
Goerigk, Marc et al. |
2010 |
| 22 |
The Complexity of Integrating Routing Decisions in Public Transportation Models |
Schmidt, Marie et al. |
2010 |
| 23 |
Vertex Disjoint Paths for Dispatching in Railways |
Flier, Holger et al. |
2010 |
| 24 |
Dynamic Algorithms for Recoverable Robustness Problems |
Cicerone, Serafino et al. |
2008 |
| 25 |
IP-based Techniques for Delay Management with Priority Decisions |
Schachtebeck, Michael et al. |
2008 |
| 26 |
A Game-Theoretic Approach to Line Planning |
Schöbel, Anita et al. |
2006 |
| 27 |
Line Planning with Minimal Traveling Time |
Schöbel, Anita et al. |
2006 |
| 28 |
Station Location - Complexity and Approximation |
Mecke, Steffen et al. |
2006 |
