Algorithm engineering in robust optimization M Goerigk, A Schöbel Algorithm engineering, 245-279, 2016 | 118 | 2016 |
A comprehensive evacuation planning model and genetic solution algorithm M Goerigk, K Deghdak, P Heßler Transportation research part E: logistics and transportation review 71, 82-97, 2014 | 102 | 2014 |
A robust bus evacuation model with delayed scenario information M Goerigk, B Grün Or Spectrum 36 (4), 923-948, 2014 | 75* | 2014 |
Branch and bound algorithms for the bus evacuation problem M Goerigk, B Grün, P Heßler Computers & Operations Research 40 (12), 3010-3020, 2013 | 74 | 2013 |
Improving the modulo simplex algorithm for large-scale periodic timetabling M Goerigk, A Schöbel Computers & Operations Research 40 (5), 1363-1370, 2013 | 68 | 2013 |
A two-stage robustness approach to evacuation planning with buses M Goerigk, K Deghdak, V T’Kindt Transportation Research Part B: Methodological 78, 66-82, 2015 | 65 | 2015 |
Evaluating line concepts using travel times and robustness M Goerigk, M Schachtebeck, A Schöbel Public Transport 5 (3), 267-284, 2013 | 64 | 2013 |
Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling M Goerigk, A Schöbel Computers & Operations Research 52, 1-15, 2014 | 58 | 2014 |
An experimental comparison of periodic timetabling models M Siebert, M Goerigk Computers & Operations Research 40 (10), 2251-2259, 2013 | 54 | 2013 |
An empirical analysis of robustness concepts for timetabling M Goerigk, A Schöbel | 54 | 2010 |
Line planning with user-optimal route choice M Goerigk, M Schmidt European Journal of Operational Research 259 (2), 424-436, 2017 | 52 | 2017 |
The price of strict and light robustness in timetable information M Goerigk, M Schmidt, A Schöbel, M Knoth, M Müller-Hannemann Transportation Science 48 (2), 225-242, 2014 | 50 | 2014 |
Robust load planning of trains in intermodal transportation F Bruns, M Goerigk, S Knust, A Schöbel OR spectrum 36 (3), 631-668, 2014 | 48 | 2014 |
Combining bus evacuation with location decisions: A branch-and-price approach M Goerigk, B Grün, P Heßler Transportation Research Procedia 2, 783-791, 2014 | 43 | 2014 |
A scenario-based approach for robust linear optimization M Goerigk, A Schöbel International conference on theory and practice of algorithms in (computer …, 2011 | 43 | 2011 |
The price of robustness in timetable information M Goerigk, M Knoth, M Müller-Hannemann, M Schmidt, A Schöbel 11th Workshop on algorithmic approaches for transportation modelling …, 2011 | 42 | 2011 |
The quadratic shortest path problem: complexity, approximability, and solution methods B Rostami, A Chassein, M Hopf, D Frey, C Buchheim, F Malucelli, ... European Journal of Operational Research 268 (2), 473-485, 2018 | 41 | 2018 |
Algorithms and uncertainty sets for data-driven robust shortest path problems A Chassein, T Dokka, M Goerigk European Journal of Operational Research 274 (2), 671-686, 2019 | 31 | 2019 |
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem AB Chassein, M Goerigk European Journal of Operational Research 244 (3), 739-747, 2015 | 31 | 2015 |
Algorithm engineering in robust optimization M Goerigk, A Schöbel arXiv preprint arXiv:1505.04901, 2015 | 31 | 2015 |