Home > Research > Researchers > Marc Goerigk

Research

Research output

Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations

Dokka, T. & Goerigk, M., 30/06/2023, In: Computers and Operations Research. 154, 12 p., 106213.

A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

Bold, M. & Goerigk, M., 30/09/2022, In: Operations Research Letters. 50, 5, p. 581-587 7 p.

Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming

Hughes, M., Goerigk, M. & Dokka, T., 30/09/2021, In: Computers and Operations Research. 133, 25 p., 105364.

Particle Swarm Metaheuristics for Robust Optimisation with Implementation Uncertainty

Hughes, M., Goerigk, M. & Dokka Venkata Satyanaraya, T., 1/10/2020, In: Computers and Operations Research. 122, 21 p., 104998.

Mixed uncertainty sets for robust combinatorial optimization

Dokka, T., Goerigk, M. & Roy, R., 1/09/2020, In: Optimization Letters. 14, p. 1323–1337 15 p.

An Efficient Approach to Distributionally Robust Network Capacity Planning

Dokka Venkata Satyanaraya, T., Garuba, F., Goerigk, M. & Jacko, P., 9/04/2020, In: arXiv.

A Comparison of Data-Driven Uncertainty Sets for Robust Network Design

Garuba, F., Goerigk, M. & Jacko, P., 23/03/2020, In: arXiv.

Generating hard instances for robust combinatorial optimization

Goerigk, M. & Maher, S. J., 1/01/2020, In: European Journal of Operational Research. 280, 1, p. 34-45 12 p.

A comparison of discrete and polyhedral uncertainty sets for robust network design

Garuba, F., Goerigk, M. & Jacko, P., 2020

Robust Network Capacity Expansion with Non-linear Costs

Garuba, F., Goerigk, M. & Jacko, P., 15/11/2019, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2019. Cacchiani, V. & Marchetti-Spaccamela, A. (eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, p. 5.1-5.13 13 p. (OASICS; vol. 75).

A Comparison of Models for Uncertain Network Design

Garuba, F., Goerigk, M. & Jacko, P., 23/06/2019. 20 p.

A Largest Empty Hypersphere Metaheuristic for Robust Optimisation with Implementation Uncertainty

Hughes, M., Goerigk, M. & Wright, M. B., 03/2019, In: Computers and Operations Research. 103, p. 64-80 17 p.

Representative scenario construction and preprocessing for robust combinatorial optimization problems

Goerigk, M. & Hughes, M., 29/10/2018, (E-pub ahead of print) In: Optimization Letters. 15 p.

On scenario aggregation to approximate robust combinatorial optimization problems

Chassein, A. & Goerigk, M., 10/2018, In: Optimization Letters. 12, 7, p. 1523-1533 11 p.

The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

Rostami, B., Chassein, A., Hopf, M., Frey, D., Buchheim, C., Malucelli, F. & Goerigk, M., 16/07/2018, In: European Journal of Operational Research. 268, 2, p. 473-485 13 p.

On recoverable and two-stage robust selection problems with budgeted uncertainty

Chassein, A., Goerigk, M., Kasperski, A. & Zielinski, P., 1/03/2018, In: European Journal of Operational Research. 265, 2, p. 423-436 14 p.

Compromise Solutions for Robust Combinatorial Optimization with Variable-Sized Uncertainty

Chassein, A. & Goerigk, M., 5/02/2018, (E-pub ahead of print) In: European Journal of Operational Research. 269, 2, p. 544-555 12 p.

Ranking robustness and its application to evacuation planning

Goerigk, M., Hamacher, H. W. & Kinscherff, A., 1/02/2018, In: European Journal of Operational Research. 264, 3, p. 837-846 10 p.

Variable-sized uncertainty and inverse problems in robust optimization

Chassein, A. & Goerigk, M., 1/01/2018, In: European Journal of Operational Research. 264, 1, p. 17-28 12 p.

Decision Support Systems for Urban Evacuation Logistics in Practice

Goerigk, M., Schmitt, S. & Hamacher, H. W., 15/11/2017, The Palgrave Handbook of Humanitarian Logistics and Supply Chain Management. Kovács, G., Spens, K. & Moshtari, M. (eds.). Palgrave Macmillan

A biobjective approach to recoverable robustness based on location planning

Carrizosa, E., Goerigk, M. & Schöbel, A., 1/09/2017, In: European Journal of Operational Research. 261, 2, p. 421-435 15 p.

An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems

Dokka Venkata Satyanaraya, T. & Goerigk, M., 1/09/2017, Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS2017). D'Angelo, G. & Dollevoet, T. (eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, p. 16:1-16:13 13 p. 16. (Open Access Series in Informatics ; vol. 59).

An Improved Algorithm for the Periodic Timetabling Problem

Goerigk, M. & Liebchen, C., 1/09/2017, 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). D'Angelo, G. & Dollevoet, T. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 12:1-12:14 14 p. 12. (Open Access Series in Informatics; vol. 59).

Line planning with user-optimal route choice

Goerigk, M. & Schmidt, M., 1/06/2017, In: European Journal of Operational Research. 259, 2, p. 424-436 13 p.

An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems

Dokka Venkata Satyanaraya, T. & Goerigk, M., 27/04/2017, 15 p.

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets

Chassein, A. & Goerigk, M., 1/04/2017, In: European Journal of Operational Research. 258, 1, p. 58-69 12 p.

On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty

Chassein, A., Goerigk, M., Kasperski, A. & Zielinski, P., 16/02/2017, 40 p.

On Scenario Aggregation to Approximate Robust Optimization Problems

Chassein, A. & Goerigk, M., 29/11/2016, 10 p.

Algorithm engineering in robust optimization

Goerigk, M. & Schöbel, A., 11/11/2016, Algorithm Engineering: Selected Results and Surveys. Kliemann, L. & Sanders, P. (eds.). Springer, p. 245-279 35 p. (Lecture Notes in Computer Science; vol. 9220).

Compromise Solutions for Robust Combinatorial Optimization with Variable-Sized Uncertainty

Chassein, A. & Goerigk, M., 17/10/2016, 22 p.

On the recoverable robust traveling salesman problem

Chassein, A. & Goerigk, M., 10/2016, In: Optimization Letters. 10, 7, p. 1479-1492 14 p.

Robust flows with losses and improvability in evacuation planning

Goerigk, M. & Ndiaye, I. A., 09/2016, In: EURO Journal on Computational Optimization. 4, 3-4, p. 241-270 30 p.

SI: disaster risk management

Goerigk, M. & Hamacher, H. W., 09/2016, In: EURO Journal on Computational Optimization. 4, 3-4, p. 215-217 3 p.

Robust storage loading problems with stacking and payload constraints

Goerigk, M., Knust, S. & Le, X. T., 16/08/2016, In: European Journal of Operational Research. 253, 1, p. 51-67 17 p.

Improvable Knapsack Problems

Goerigk, M., Sabharwal, Y., Schöbel, A. & Sen, S., 28/07/2016, 21 p.

Performance analysis in robust optimization

Chassein, A. & Goerigk, M., 13/07/2016, Robustness analysis in decision aiding, optimization, and analytics. Doumpos, M., Zopounidis, C. & Grigoroudis, E. (eds.). Springer, p. 145-170 26 p. (International Series in Operations Research and Management Science; vol. 241).

Variable-Sized Uncertainty and Inverse Problems in Robust Optimization

Chassein, A. & Goerigk, M., 23/06/2016, 32 p.

A biobjective approach to robustness based on location planning

Carrizosa, E., Goerigk, M. & Schöbel, A., 12/04/2016.

Line planning with user-optimal route choice

Goerigk, M. & Schmidt, M., 12/04/2016.

A combined local search and integer programming approach to the traveling tournament problem

Goerigk, M. & Westphal, S., 04/2016, In: Annals of Operations Research. 239, 1, p. 343-354 12 p.

The quadratic shortest path problem: complexity, approximability, and solution methods

Rostami, B., Chassein, A., Hopf, M., Frey, D., Buchheim, C., Malucelli, F. & Goerigk, M., 24/02/2016, 22 p.

A bicriteria approach to robust optimization

Chassein, A. & Goerigk, M., 02/2016, In: Computers and Operations Research. 66, p. 181-189 9 p.

Ranking robustness and its application to evacuation planning

Goerigk, M., Hamacher, H. W. & Kinscherff, A., 2016, 22 p.

Transit dependent evacuation planning for Kathmandu Valley: a case study

Pyakurel, U., Goerigk, M., Dhamala, T. N. & Hamacher, H. W., 2016, In: International Journal of Operational Research/Nepal. 5, 1, p. 49-73 25 p.

Zone-based, robust flood evacuation planning

Büttner, S. & Goerigk, M., 2016, 20 p.

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem

Chassein, A. B. & Goerigk, M., 1/08/2015, In: European Journal of Operational Research. 244, 3, p. 739-747 9 p., 12792.

A two-stage robustness approach to evacuation planning with buses

Goerigk, M., Deghdak, K. & T'Kindt, V., 08/2015, In: Transportation Research Part B: Methodological. 78, p. 66-82 17 p.

Alternative formulations for the ordered weighted averaging objective

Chassein, A. & Goerigk, M., 06/2015, In: Information Processing Letters. 115, 6-8, p. 604-608 5 p.

Algorithm engineering in robust optimization

Goerigk, M. & Schöbel, A., 19/05/2015, In: arxiv.org.

Optimisation models to enhance resilience in evacuation planning

Goerigk, M. & Hamacher, H. W., 04/2015, In: Civil Engineering and Environmental Systems. 32, 1-2, p. 90-99 10 p.

Exact and heuristic approaches to the robust periodic event scheduling problem

Goerigk, M., 03/2015, In: Public Transport. 7, 1, p. 101-119 19 p.

The robust knapsack problem with queries

Goerigk, M., Gupta, M., Ide, J., Schöbel, A. & Sen, S., 03/2015, In: Computers and Operations Research. 55, p. 12-22 11 p.

A bicriteria approach to recovery robustness

Goerigk, M., Schöbel, A. & Carrizosa, E., 2015, (Unpublished).

Robust flows with losses and improvability in evacuation planning

Goerigk, M. & Ndiaye, I. A., 2015.

A note on upper bounds to the robust knapsack problem with discrete scenarios

Goerigk, M., 12/2014, In: Annals of Operations Research. 223, 1, p. 461-469 9 p.

Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling

Goerigk, M. & Schöbel, A., 12/2014, In: Computers and Operations Research. 52, PART A, p. 1-15 15 p.

Robust Geometric Programming is co-NP hard

Chassein, A. & Goerigk, M., 12/2014.

ROPI - a robust optimization programming interface for C++

Goerigk, M., 2/11/2014, In: Optimization Methods and Software. 29, 6, p. 1261-1280 20 p.

A comprehensive evacuation planning model and genetic solution algorithm

Goerigk, M., Deghdak, K. & Heßler, P., 11/2014, In: Transportation Research Part E: Logistics and Transportation Review. 71, p. 82-97 16 p.

A new model for macroscopic pedestrian evacuation planning with safety and duration criteria

Ndiaye, I. A., Neron, E., Linot, A., Monmarche, N. & Goerigk, M., 2/10/2014, In: Transportation Research Procedia. 2, p. 486-494 9 p.

Combining bus evacuation with location decisions: a branch-and-price approach

Goerigk, M., Grün, B. & Heßler, P., 2/10/2014, In: Transportation Research Procedia. 2, p. 783-791 9 p.

A robust bus evacuation model with delayed scenario information

Goerigk, M. & Grün, B., 10/2014, In: OR Spectrum. 36, 4, p. 923-948 26 p.

Robust load planning of trains in intermodal transportation

Bruns, F., Goerigk, M., Knust, S. & Schöbel, A., 07/2014, In: OR Spectrum. 36, 3, p. 631-668 38 p.

Approximation algorithms for the weight-reducible knapsack problem

Goerigk, M., Sabharwal, Y., Schöbel, A. & Sen, S., 2014, Theory and Applications of Models of Computation. TAMC 2014. Berlin: Springer, p. 203-215 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8402 ).

Solving the traveling tournament problem by packing three-vertex paths

Goerigk, M., Kawarabayashi, K. I., Hoshino, R. & Westphal, S., 2014, Proceedings of the National Conference on Artificial Intelligence. AI Access Foundation, Vol. 3. p. 2271-2277 7 p.

The price of strict and light robustness in timetable information

Goerigk, M., Schmidt, M., Schöbel, A., Knoth, M. & Müller-Hannemann, M., 2014, In: Transportation Science. 48, 2, p. 225-242 18 p.

Branch and bound algorithms for the bus evacuation problem

Goerigk, M., Grün, B. & Heßler, P., 12/2013, In: Computers and Operations Research. 40, 12, p. 3010-3020 11 p.

An experimental comparison of periodic timetabling models

Siebert, M. & Goerigk, M., 10/2013, In: Computers and Operations Research. 40, 10, p. 2251-2259 9 p.

Evaluating line concepts using travel times and robustness: simulations with the LinTim toolbox

Goerigk, M., Schachtebeck, M. & Schöbel, A., 10/2013, In: Public Transport. 5, 3, p. 267-284 18 p.

Improving the modulo simplex algorithm for large-scale periodic timetabling

Goerigk, M. & Schöbel, A., 05/2013, In: Computers and Operations Research. 40, 5, p. 1363-1370 8 p.

Algorithms and concepts for robust optimization

Goerigk, M., 14/01/2013, Göttingen: Georg-August-Universität Göttingen. 213 p.

Recoverable robust timetable information

Goerigk, M., Heße, S., Müller-Hannemann, M., Schmidt, M. & Schöbel, A., 2013, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Frigioni, D. & Stiller, S. (eds.). Dagstuhl: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-14 14 p. (OpenAccess Series in Informatics; vol. 33).

A scenario-based approach for robust linear optimization

Goerigk, M. & Schöbel, A., 2011, Theory and Practice of Algorithms in (Computer) Systems. Marchetti-Spaccamela, A. & Segal, M. (eds.). Berlin: Springer, p. 139-150 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6595).

Engineering the modulo network simplex heuristic for the periodic timetabling problem

Goerigk, M. & Schöbel, A., 2011, Experimental Algorithms. Pardalos, P. M. & Rebennack, S. (eds.). Berlin: Springer, p. 181-192 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6630).

The price of robustness in timetable information

Goerigk, M., Knoth, M., Müller-Hannemann, M., Schmidt, M. & Schöbel, A., 2011, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Caprara, A. & Kontogiannis, S. (eds.). Dagstuhl: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 76-87 12 p. (OpenAccess Series in Informatics (OASIcs); vol. 20).

An empirical analysis of robustness concepts for timetabling

Goerigk, M. & Schöbel, A., 2010, OpenAccess Series in Informatics. Vol. 14. p. 100-113 14 p.