Hinweise zum Einsatz der Google Suche
Personensuchezur unisono Personensuche
Veranstaltungssuchezur unisono Veranstaltungssuche
Katalog plus


 Working Papers

  • 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 [preprint]
  • M. Goerigk, A. Kasperski, P. Zielinski. Robust two-stage combinatorial optimization problems under convex uncertainty. [preprint]
  • F. Garuba, M. Goerigk, P. Jacko. A Comparison of Models for Uncertain Network Design. [preprint]
  • A. Chassein, M. Goerigk, A. Kasperski, P. Zielinski. Approximating multiobjective combinatorial optimization problems with the OWA criterion. [preprint]
  • T. Dokka, M. Goerigk. The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods. [preprint]
  • A. Chassein, M. Goerigk. The Complexity of 2-Adaptability in Robust Optimization.
  • M. Hughes, M. Goerigk, T. Dokka. Particle Swarm Metaheuristics for Robust Optimisation with Implementation Uncertainty.
  • S. Boge, M. Goerigk, S. Knust. Robust optimization for premarshalling with uncertain priority classes.
  • M. Goerigk, J.Kurtz, M. Poss. Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty. [preprint]


  • M. Bold, B. Boyaci, M. Goerigk, C. Kirkbride. The generalised resource-constrained project scheduling problem with flexible resource profiles. To appear in Proceedings of PMS2020.
  • 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, Pages 29-45 [paper] [preprint]


  • M.Goerigk, A. Kasperski, P. Zielinski. Solving robust two-stage combinatorial optimization problems under convex uncertainty. To appear in OR2019 Proceedings.
  • 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]
  • T. Dokka, M. Goerigk, R. Roy. Mixed Uncertainty Sets for Robust Combinatorial Optimization. To appear in Optimization Letters [paper] [preprint]
  •  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]


  • 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]


  • 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]



  • 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]


  • 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]



  • 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]



  • 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]



  • 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]


  • 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]


  • 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]