No. |
Title |
Author |
Year |
1 |
A Phase I Simplex Method for Finding Feasible Periodic Timetables |
Goerigk, Marc et al. |
2021 |
2 |
Robust Network Capacity Expansion with Non-Linear Costs |
Garuba, Francis et al. |
2019 |
3 |
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems |
Dokka, Trivikram et al. |
2017 |
4 |
An Improved Algorithm for the Periodic Timetabling Problem |
Goerigk, Marc et al. |
2017 |
5 |
Front Matter, Table of Contents, Preface, Organization |
Goerigk, Marc et al. |
2016 |
6 |
Recoverable Robust Timetable Information |
Goerigk, Marc et al. |
2013 |
7 |
The Price of Robustness in Timetable Information |
Goerigk, Marc et al. |
2011 |
8 |
An Empirical Analysis of Robustness Concepts for Timetabling |
Goerigk, Marc et al. |
2010 |