Working Papers

• Y. Anoshkina, M. Goerigk, F. Meisel. Robust Optimization Approaches for Routing and Scheduling of Multi-Skilled Teams under Uncertain Job Skill Requirements [preprint]

• W. Baak, M. Goerigk, A. Kasperski, P. Zieliński. Generalizing the Min-Max Regret Criterion using Ordered Weighted Averaging [preprint]

• M. Bold, M. Goerigk. Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty [preprint]

• M. Goerigk, J. Kurtz. Data-driven Prediction of Relevant Scenarios for Robust Optimization. [preprint]

• M. Goerigk, J. Kurtz, M. Schmidt, J. Thürauf. Connections and Reformulations between Robust and Bilevel Optimization. [preprint]

• M. Goerigk, S. Lendl, L. Wulf. On the Recoverable Traveling Salesman Problem. [preprint]

• S. Rodrı́guez-Ballesteros, M. Goerigk, J. Alcaraz, L. Anton-Sanchez. A Robust Optimization Approach for Project Scheduling with Uncertain Start-Time Dependent Costs.

2024

• J.-N. Buckow, M. Goerigk, S. Knust. Retrieval optimization in a warehouse with multiple input/output-points. To appear in OR Spectrum.
• M. Goerigk, M. Khosravi. Robust Combinatorial Optimization Problems Under Budgeted Interdiction Uncertainty. To appear in OR Spectrum. [paper][preprint]
• M. Goerigk, M. Khosravi. Benchmarking Problems for Robust Discrete Optimization. Computers & Operations Research. Volume 166, June 2024, 106608. [paper][preprint]
• K.-M. Aigner, M. Goerigk, M. Hartisch, F. Liers, A. Miehlich. A Framework for Data-Driven Explainability in Mathematical Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 38(19), 20912-20920. [paper][preprint]
• M. Goerigk, S. Lendl, L. Wulf. On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. Discrete Applied Mathematics. Volume 343, 30 January 2024, Pages 355-370 [paper][preprint]
• W. Baak, M. Goerigk, M. Hartisch. A Preference Elicitation Approach for the Risk-Averse Ordered Weighted Averaging Criterion using Solution Choice Observations. European Journal of Operational Research. Volume 314, Issue 3, 1 May 2024, Pages 1098-1110. [paper][preprint]

2023

• Ph. Schiewe, M. Goerigk, N. Lindner. Introducing TimPassLib -- A library for integrated periodic timetabling and passenger routing. Operations Research Forum, 4, 64 (2023). [paper][preprint]

• M. Goerigk, R. Guillaume, A. Kasperski, P. Zieliński. Robust optimization with belief functions. International Journal of Approximate Reasoning. Volume 159, August 2023, 108941. [paper][preprint]

• M. Goerigk, M. Hartisch. A Framework for Inherently Interpretable Optimization Models. European Journal of Operational Research. Volume 310, Issue 3, 1 November 2023, Pages 1312-1324. [paper][preprint]

• M. Goerigk, M. Khosravi. Optimal Scenario Reduction for One- and Two-Stage Robust Optimization with Discrete Uncertainty in the Objective. European Journal of Operational Research. Volume 310, Issue 2, 16 October 2023, Pages 529-551. [paper][preprint]

• T. Dokka, M. Goerigk. Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. Computers & Operations Research. Volume 154, June 2023, 106213. [paper][preprint]

• M. Goerigk, M. Hartisch. Combinatorial Optimization Problems with Balanced Regret. Discrete Applied Mathematics. Volume 328, 31 March 2023, Pages 40-59. [paper][preprint]

• M. Goerigk, J. Kurtz. Data-Driven Robust Optimization using Unsupervised Deep Learning. Computers & Operations Research. Volume 151, March 2023, 106087. [paper][preprint]

2022

• M. Bold, M. Goerigk. A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Operations Research Letters. Volume 50, Issue 5, September 2022, Pages 581-587. [paper][preprint]

• M. Goerigk, S. Lendl, L. Wulf. Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. European Journal of Operational Research. Volume 303, Issue 2, 1 December 2022, Pages 567-580. [paper][preprint]

• M. Bold, M. Goerigk. Investigating the Recoverable Robust Single Machine Scheduling Problem Under Interval Uncertainty. Discrete Applied Mathematics. Volume 313, 31 May 2022, Pages 99-114. [paper][preprint]

• M. Goerigk, S. Lendl, L. Wulf. Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. European Journal of Operational Research. Volume 302, Issue 1, 1 October 2022, Pages 62-78. [paper][preprint]

• M. Goerigk, A. Kasperski, P. Zielinski. Robust two-stage combinatorial optimization problems under convex uncertainty. Journal of Combinatorial Optimization volume 43, pages 497–527 (2022). [paper][preprint]

2021

• M. Goerigk, A. Schöbel, F. Spühler. A Phase I Simplex Method for Finding Feasible Periodic Timetables. In Proceedings of ATMOS21, 6:1-6:13. [paper]

• M. Goerigk, M. Hartisch. Multistage Robust Combinatorial Optimization via Quantified Integer Programming. Computers & Operations Research. Volume 135, November 2021, 105434. [paper][preprint]

• M. Goerigk, S. Lendl. Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open Journal of Mathematical Optimization, Volume 2 (2021), article no. 3, 18 p. [paper][preprint]

• D. E. Hollermann, M. Goerigk, D. F. Hoffrogge, M. Hennen, A. Bardow. Flexible here-and-now decisions for two-stage multi-objective optimization: Method and application to energy system design selection. Optimization and Engineering volume 22, pages 821–847 (2021). [paper][preprint]

• M. Hughes, M. Goerigk, T. Dokka. Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems. Computers & Operations Research. Volume 133, September 2021, 105364. [paper][preprint]

• M. Goerigk, A. Kasperski, P. Zielinski. Combinatorial two-stage minmax regret problems under interval uncertainty. Annals of Operations Research. Volume 300, pages 23–50 (2021). [paper][preprint]

• A. Chassein, M. Goerigk. On the Complexity of Min-Max-Min Robustness with Two Alternatives and Budgeted Uncertainty. Discrete Applied Mathematics. Volume 296, 15 June 2021, Pages 141-163. [paper]

• M. Bold, M. Goerigk. A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Computers & Operations Research, Volume 130, June 2021, 105232. [paper][preprint]

2020

• M. Goerigk, J. Kurtz, M. Poss. Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty. Discrete Applied Mathematics. Volume 285, 15 October 2020, Pages 707-725. [paper][preprint]

• M. Hughes, M. Goerigk, T. Dokka. Particle swarm metaheuristics for robust optimisation with implementation uncertainty. Computers & Operations Research Volume 122, October 2020 [paper][preprint]

• S. Boge, M. Goerigk, S. Knust. Robust optimization for premarshalling with uncertain priority classes. European Journal of Operational Research. Volume 287, Issue 1, 16 November 2020, Pages 191-210 [paper]

• A. Chassein, M. Goerigk, A. Kasperski, P. Zielinski. Approximating combinatorial optimization problems with the ordered weighted averaging criterion. European Journal of Operational Research. Volume 286, Issue 3, 1 November 2020, Pages 828-838 [paper][preprint]

• M. Bold, B. Boyaci, M. Goerigk, C. Kirkbride. The generalised resource-constrained project scheduling problem with flexible resource profiles. Proceedings of PMS2020/2021. [paper]

• M. Goerigk, S. J. Maher. Generating Hard Instances for Robust Combinatorial Optimization. European Journal of Operational Research Volume 280, Issue 1, 1 January 2020, Pages 34-45 [paper][preprint]

• M. Goerigk, A. Kasperski, P. Zielinski. Two-stage Combinatorial Optimization Problems under Risk. Theoretical Computer Science Volume 804, 12 January 2020, Pages 29-45 [paper] [preprint]

• T. Dokka, M. Goerigk, R. Roy. Mixed Uncertainty Sets for Robust Combinatorial Optimization. Optimization Letters volume 14, pages 1323–1337 (2020). [paper] [preprint]

2019 

• M.Goerigk, A. Kasperski, P. Zielinski. Solving robust two-stage combinatorial optimization problems under convex uncertainty. Operations Research Proceedings 2019, pp 423-429. [paper]

• M. Goerigk, M. Hughes. Representative scenario construction and preprocessing for robust combinatorial optimization problems. Optimization Letters. Volume 13, Issue 6, September 2019, Pages 1417 - 1431  . [paper]

• F. Garuba, M. Goerigk, P. Jacko. Robust Network Capacity Expansion with Non-linear Costs. In Proceedings of ATMOS19, 5:1-5:13. [paper]

•  A. Chassein, M. Goerigk, J. Kurtz, M. Poss. Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty. European Journal of Operational Research. Volume 279, Issue 2, 1 December 2019, Pages 308-319 [paper][preprint]

• A. Chassein, T. Dokka, M. Goerigk. Algorithms and uncertainty sets for data-driven robust shortest path problems. European Journal of Operational Research. Volume 274, Issue 2, 16 April 2019, Pages 671-686. [paper] [preprint]

• M. Hughes, M. Goerigk, M. Wright. A Largest Empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. Computers & Operations Research. Volume 103, March 2019. Pages 64-80. [paper] [preprint]

• A. Chassein, M. Goerigk. On the complexity of robust geometric programming with polyhedral uncertainty. Operations Research Letters. Volume 47, Issue 1, January 2019, Pages 21-24. [paper]

2018

• A. Chassein, M. Goerigk. On Scenario Aggregation to Approximate Robust Combinatorial Optimization Problems. Optimization Letters. October 2018, Pages 1523-1533. [paper]

• A. Chassein, M. Goerigk. Compromise Solutions for Robust Combinatorial Optimization with Variable-Sized Uncertainty. European Journal of Operational Research. Volume 269, Issue 2, September 2018, Pages 544-555. [paper] [preprint]

• B. Rostami, A. Chassein, M. Hopf, D. Frey, C. Buchheim, F. Malucelli, M. Goerigk. The Quadratic Shortest Path Problem: Complexity Approximability, and Solution Methods. European Journal of Operational Research.  Volume 268, Issue 2, 16 July 2018, Pages 473-485. [paper]

• A. Chassein, M. Goerigk, A. Kasperski, P. Zielinski.  On Recoverable and Two-stage Robust Selection Problems with Budgeted Uncertainty. European Journal of Operational Research. Volume 265, Issue 2, 1 March 2018, Pages 423-436. [paper] [preprint]

• M. Goerigk, H. W. Hamacher, A. Kinscherff. Ranking Robustness and its Application to Evacuation Planning. European Journal of Operational Research. Volume 264. Issue 3, 1 February 2018, Pages 837-846. [paper]

• A. Chassein, M. Goerigk. Variable-Sized Uncertainty and Inverse Problems in Robust Optimization. European Journal of Operational Research. Volume 264, Issue 1, 1 January 2018, Pages 17-28. [paper] [preprint]

• M. Goerigk, S. Schmitt, H. W. Hamacher. Decision Support Systems for Urban Evacuation Logistics in Practice. In M. Moshtari (eds), Handbook of Humanitarian Logistics and Supply Chain Management, Palgrave Macmillan. [paper]

2017

• E. Carrizosa, M. Goerigk, A. Schöbel. A biojective approach to recoverable robustness based on location planning. European Journal of Operational Research. Volume 261, Issue 2, 1 September, Pages 421-435. [paper]

• A. Chassein, M. Goerigk. Minmax Regret Combinatorial Optimization Problems with Ellipsoidal Uncertainty Sets. European Journal of Operational Research. Volume 258, Issue 1, 1 April 2017, Pages 58–69. [paper]

• M. Goerigk, M. Schmidt. Line planning with user-optimal route choice. European Journal of Operational Research. Volume 259, Issue 2, 1 June 2017, Pages 424–436. [paper] [preprint]

• T. Dokka, M. Goerigk. 2017. An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. In Proceedings of ATMOS17, 16:1-16:13. [paper]

• M. Goerigk, C. Liebchen. 2017. An Improved Algorithm for the Periodic Timetabling Problem. In Proceedings of ATMOS17, 12:1-12:14.[paper]

2016

• A. Chassein, M. Goerigk. On the recoverable robust traveling salesman problem. Optimization Letters. October 2016, Volume 10, Issue 7, pp 1479–1492. [paper]

• M. Goerigk, I. A. Ndiaye. Robust Flows with Losses and Improvability in Evacuation Planning. EURO Journal on Computational Optimization, September 2016, Volume 4, Issue 3, pp 241–270. [paper]

• M. Goerigk, H. W. Hamacher. SI: disaster risk management. EURO Journal on Computational Optimization, September 2016, Volume 4, Issue 3, pp 215–217. [paper]

• M. Goerigk, S. Knust, X. T. Le. Robust storage loading problems with stacking and payload constraints. European Journal of Operational Research. Volume 253, Issue 1, 16 August 2016, Pages 51–67. [paper]

• M. Goerigk, S. Westphal. Combined Local Search and Integer Programming Approach to the Traveling Tournament Problem. Annals of Operations Research. April 2016, Volume 239, Issue 1, pp 343-354. [paper]

• A. Chassein, M. Goerigk. A Bicriteria Approach to Robust Optimization. Computers & Operations Research. Volume 66, February 2016, Pages 181–189. [paper] [preprint]

• U. Pyakurel, M. Goerigk, T. N. Dhamala, H. W. Hamacher. Transit Dependent Evacuation Planning for Kathmandu Valley: A Case Study. International Journal of Operational Research/Nepal. Volume 5, Issue 1, 2016, pages 49 - 73. [paper]

• A. Chassein and M. Goerigk. Performance Analysis in Robust Optimization. In Doumpos, M., Zopounidis, C., and Grigoroudis, E. (eds), Robustness Analysis in Decision Aiding, Optimization, and Analytics, International Series in Operations Research & Management Science, Springer, 2016. [paper] [preprint]

• M. Goerigk and A. Schöbel. Algorithm engineering in robust optimization. In L. Kliemann, P. Sanders, editors, Algorithm Engineering: Selected Results and Surveys, volume 9220 of LNCS State of the Art, pp 245-279. Springer, 2016. [paper] [preprint]

2015

• M. Goerigk, K. Deghdak, V. T'Kindt. A Two-Stage Robustness Approach to Evacuation Planning with Buses. Transportation Research Part B. Volume 78, August 2015, Pages 66-82. [paper] [preprint]

• M. Goerigk, H. W. Hamacher. Optimisation Models to Enhance Resilience in Evacuation Planning. Civil Engineering and Environmental Systems. Volume 32, Issue 1-2, 2015. [paper] [preprint]

• A. Chassein, M. Goerigk. A New Bound for the Midpoint Solution in Minmax Regret Optimization with an Application to the Robust Shortest Path Problem. European Journal of Operational Research. Volume 244, Issue 3, 1 August 2015, Pages 739–747. [paper]

• A. Chassein, M. Goerigk. Alternative Formulations for the Ordered Weighted Averaging Objective. Information Processing Letters. Volume 115, Issues 6-8, June-August 2015, Pages 604-608. [paper]

• M. Goerigk. Exact and Heuristic Approaches to the Robust Periodic Event Scheduling Problem. Public Transport. March 2015, Volume 7, Issue 1, pp 101-119. [paper]

• M. Goerigk, M. Gupta, J. Ide, A. Schöbel, S. Sen. The Robust Knapsack Problem with Queries. Computers & Operations Research. Volume 55, March 2015, Pages 12–22. [paper]

2014

• M. Goerigk, A. Schöbel. Recovery-to-Optimality: A New Two-Stage Approach to Robustness with an Application to Aperiodic Timetabling.Computers & Operations Research. Volume 52, Part A, December 2014, Pages 1–15. [paper]

• M. Goerigk, K. Deghdak, P. Heßler. A Comprehensive Evacuation Planning Model and Genetic Solution Algorithm. Transportation Research Part E. Volume 71, November 2014, Pages 82–97. [paper]

• M. Goerigk, B. Grün. A Robust Bus Evacuation Model with Delayed Scenario Information. OR Spectrum. October 2014, Volume 36, Issue 4, pp 923-948. [paper]

• F. Bruns, M. Goerigk, S. Knust, A. Schöbel. Robust load planning of trains in intermodal transportation. OR Spectrum. Volume 36, Issue 3, July 2014, Pages 631-668. [paper]

• M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, A. Schöbel.  The Price of Strict and Light Robustness in Timetable InformationTransportation Science. Volume 48, Issue 2, May 2014, Pages 225-242. [paper]

• M. Goerigk. ROPI - A Robust Optimization Programming Interface for C++. Optimization Methods and Software. Volume 29, Issue 6, 2014, Pages 1261-1280. [paper]

• I. Ndiaye, E. Neron, A. Linot, N. Nonmarche, M. Goerigk. 2014. A new model for macroscopic pedestrian evacuation planning with safety and duration criteria. In Proceedings of PED14, Transportation Research Procedia Volume 2, 2014, Pages 486–494. [paper]

• M. Goerigk, B. Grün, P. Heßler. 2014. Combining bus evacuation with location decisions: a branch-and-price approach. In Proceedings of PED14, Transportation Research Procedia Volume 2, 2014, Pages 783–791. [paper]

• M. Goerigk, R. Hoshino, K. Kawarabayashi, S. Westphal. 2014. Solving the Traveling Tournament Problem by Packing Three-Vertex Paths.In Proceedings of AAAI-14, pp 2271-2277. [paper]

• M. Goerigk, Y. Sabharwal, A. Schöbel, S. Sen. 2014. Approximation Algorithms for the Weight-Reducible Knapsack Problem. In Proceedings of TAMC14, LNCS Volume 8402, 2014, pp 203-215. [paper]

2013

• M. Goerigk, B. Grün, Ph. Heßler. Branch and Bound Algorithms for the Bus Evacuation Problem. Computers & Operations Research. Volume 40, Issue 12, December 2013, Pages 3010–3020. [paper] [preprint]

• M. Goerigk, M. Schachtebeck, A. Schöbel.  Evaluating Line Concepts using Travel Times and Robustness: Simulations with the Lintim toolbox. Public Transport. Volume 5, Issue 3, October 2013, pp 267-284. [paper]

• M. Siebert, M. Goerigk. An Experimental Comparison of Periodic Timetabling Models. Computers & Operations Research. Volume 40, Issue 10, October 2013, Pages 2251–2259. [paper]

• M. Goerigk, A. Schöbel. Improving the Modulo Simplex Algorithm for Large-Scale Periodic Timetabling. Computers & Operations Research. Volume 40, Issue 5, May 2013, Pages 1363–1370. [paper]

• M. Goerigk, S. Heße, M. Müller-Hannemann, M. Schmidt, A. Schöbel. 2013. Recoverable Robust Timetable Information. In Proceedings of ATMOS13. 33: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 1-14. [paper]

 2012

• M. Goerigk. 2012. Algorithms and Concepts for Robust Optimization. Universität Göttingen (Dissertation). [paper]

• M. Goerigk, S. Westphal. 2012. A Combined Local Search and Integer Programming Approach to the Traveling Tournament Problem. In Proceedings of PATAT. SINTEF. [paper]

2011

• M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, A. Schöbel. 2011. The Price of Robustness in Timetable Information. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. 20: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 76-87. [paper]

• M. Goerigk, A. Schöbel. 2011. Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. In Proceedings of the 10th International Symposium on Experimental Algorithms (SEA). 6630: Springer. 181-192. [paper]

• M. Goerigk, A. Schöbel. 2011. A Scenario-Based Approach for Robust Linear Optimization. In Proceedings of the 1st International ICST Conference on Practice and Theory of Algorithms in (Computer) Systems (TAPAS). Springer. 139-150.  [paper]

2010

• M. Goerigk, A. Schöbel. 2010. An Empirical Analysis of Robustness Concepts for Timetabling. In Proceedings of ATMOS10. 14: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 100-113. [paper]

Sommersemester:

• Decision Making Under Uncertainty (Vorlesung)
• Combinatorial Optimization (Vorlesung)
• Fundamentals of Management Science II (Vorlesung)

• Doctoral Seminar in Optimization
• Bachelorseminar in Business Analytics
• Masterseminar in Business Analytics
• Doctoral Seminar "Recent Developments in Data Science"

Wintersemester:

• Artificial Intelligence and Optimization (Vorlesung)
• Network Optimization (Vorlesung)
• Heuristics and Approximation Methods (Vorlesung)

• Doctoral Seminar in Optimization
• Bachelorseminar in Business Analytics
• Masterseminar in Business Analytics
• Doctoral Seminar "Recent Developments in Data Science"