An Empirical Analysis of Robustness Concepts for Timetabling. - Marc Goerigk; Anita Schöbel (ATMOS, 2010)

The Price of Robustness in Timetable Information. - Marc Goerigk; Martin Knoth; Matthias Müller-Hannemann; Marie Schmidt; Anita Schöbel (ATMOS, 2011)

A Scenario-Based Approach for Robust Linear Optimization. - Marc Goerigk; Anita Schöbel (TAPAS, 2011)

Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. - Marc Goerigk; Anita Schöbel (SEA, 2011)

Recoverable Robust Timetable Information. - Marc Goerigk; Sacha Heße; Matthias Müller-Hannemann; Marie Schmidt; Anita Schöbel (ATMOS, 2013)

Branch and bound algorithms for the bus evacuation problem. - Marc Goerigk; Bob Grün; Philipp Heßler (Comput. Oper. Res., 2013)

Improving the modulo simplex algorithm for large-scale periodic timetabling. - Marc Goerigk; Anita Schöbel (Comput. Oper. Res., 2013)

An experimental comparison of periodic timetabling models. - Michael Siebert; Marc Goerigk (Comput. Oper. Res., 2013)

Evaluating line concepts using travel times and robustness. - Marc Goerigk; Michael Schachtebeck; Anita Schöbel (Public Transp., 2013)

Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. - Marc Goerigk; Richard Hoshino; Ken-ichi Kawarabayashi; Stephan Westphal (AAAI, 2014)

Approximation Algorithms for the Weight-Reducible Knapsack Problem. - Marc Goerigk; Yogish Sabharwal; Anita Schöbel; Sandeep Sen (TAMC, 2014)

A note on upper bounds to the robust knapsack problem with discrete scenarios. - Marc Goerigk (Ann. Oper. Res., 2014)

Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling. - Marc Goerigk; Anita Schöbel (Comput. Oper. Res., 2014)

ROPI - a robust optimization programming interface for C++. - Marc Goerigk (Optim. Methods Softw., 2014)

Robust load planning of trains in intermodal transportation. - Florian Bruns; Marc Goerigk; Sigrid Knust; Anita Schöbel (OR Spectr., 2014)

A robust bus evacuation model with delayed scenario information. - Marc Goerigk; Bob Grün (OR Spectr., 2014)

The Price of Strict and Light Robustness in Timetable Information. - Marc Goerigk; Marie Schmidt; Anita Schöbel; Martin Knoth; Matthias Müller-Hannemann (Transp. Sci., 2014)

The robust knapsack problem with queries. - Marc Goerigk; Manoj Gupta 002; Jonas Ide; Anita Schöbel; Sandeep Sen (Comput. Oper. Res., 2015)

Algorithm Engineering in Robust Optimization. - Marc Goerigk; Anita Schöbel (CoRR, 2015)

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2015)

Alternative formulations for the ordered weighted averaging objective. - André B. Chassein; Marc Goerigk (Inf. Process. Lett., 2015)

Exact and heuristic approaches to the robust periodic event scheduling problem. - Marc Goerigk (Public Transp., 2015)

A combined local search and integer programming approach to the traveling tournament problem. - Marc Goerigk; Stephan Westphal (Ann. Oper. Res., 2016)

A bicriteria approach to robust optimization. - André B. Chassein; Marc Goerigk (Comput. Oper. Res., 2016)

On Scenario Aggregation to Approximate Robust Optimization Problems. - Marc Goerigk; André B. Chassein (CoRR, 2016)

Improvable Knapsack Problems. - Marc Goerigk; Yogish Sabharwal; Anita Schöbel; Sandeep Sen (CoRR, 2016)

SI: disaster risk management. - Marc Goerigk; Horst W. Hamacher (EURO J. Comput. Optim., 2016)

Robust flows with losses and improvability in evacuation planning. - Marc Goerigk; Ismaila Abderhamane Ndiaye (EURO J. Comput. Optim., 2016)

Robust storage loading problems with stacking and payload constraints. - Marc Goerigk; Sigrid Knust; Xuan Thanh Le (Eur. J. Oper. Res., 2016)

On the recoverable robust traveling salesman problem. - André B. Chassein; Marc Goerigk (Optim. Lett., 2016)

Algorithm Engineering in Robust Optimization. - Marc Goerigk; Anita Schöbel (Algorithm Engineering, 2016)

An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. - Trivikram Dokka; Marc Goerigk (ATMOS, 2017)

An Improved Algorithm for the Periodic Timetabling Problem. - Marc Goerigk; Christian Liebchen (ATMOS, 2017)

A biobjective approach to recoverable robustness based on location planning. - Emilio Carrizosa; Marc Goerigk; Anita Schöbel (Eur. J. Oper. Res., 2017)

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2017)

Line planning with user-optimal route choice. - Marc Goerigk; Marie Schmidt (Eur. J. Oper. Res., 2017)

Approximating multiobjective combinatorial optimization problems with the OWA criterion. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2018)

Variable-sized uncertainty and inverse problems in robust optimization. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2018)

Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. - André B. Chassein; Marc Goerigk (Eur. J. Oper. Res., 2018)

On recoverable and two-stage robust selection problems with budgeted uncertainty. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2018)

Ranking robustness and its application to evacuation planning. - Marc Goerigk; Horst W. Hamacher; Anika Kinscherff (Eur. J. Oper. Res., 2018)

The quadratic shortest path problem: complexity, approximability, and solution methods. - Borzou Rostami; André B. Chassein; Michael Hopf; Davide Frey; Christoph Buchheim; Federico Malucelli; Marc Goerigk (Eur. J. Oper. Res., 2018)

On scenario aggregation to approximate robust combinatorial optimization problems. - André B. Chassein; Marc Goerigk (Optim. Lett., 2018)

Robust Network Capacity Expansion with Non-Linear Costs. - Francis Garuba; Marc Goerigk; Peter Jacko (ATMOS, 2019)

Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (OR, 2019)

A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. - Martin Hughes; Marc Goerigk; Michael Wright (Comput. Oper. Res., 2019)

Robust two-stage combinatorial optimization problems under convex uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2019)

Flexible here-and-now decisions for two-stage multi-objective optimization: Method and application to energy system design selection. - Dinah Elena Hollermann; Marc Goerigk; Dörthe Franzisca Hoffrogge; Maike Hennen; André Bardow (CoRR, 2019)

The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods. - Trivikram Dokka; Marc Goerigk (CoRR, 2019)

Algorithms and uncertainty sets for data-driven robust shortest path problems. - André B. Chassein; Trivikram Dokka; Marc Goerigk (Eur. J. Oper. Res., 2019)

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. - André B. Chassein; Marc Goerigk; Jannis Kurtz; Michael Poss (Eur. J. Oper. Res., 2019)

Representative scenario construction and preprocessing for robust combinatorial optimization problems. - Marc Goerigk; Martin Hughes (Optim. Lett., 2019)

On the complexity of robust geometric programming with polyhedral uncertainty. - André B. Chassein; Marc Goerigk (Oper. Res. Lett., 2019)

Particle swarm metaheuristics for robust optimisation with implementation uncertainty. - Martin Hughes; Marc Goerigk; Trivikram Dokka (Comput. Oper. Res., 2020)

Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems. - Martin Hughes; Marc Goerigk; Trivikram Dokka (CoRR, 2020)

Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty. - Matthew Bold; Marc Goerigk (CoRR, 2020)

Data-Driven Robust Optimization using Unsupervised Deep Learning. - Marc Goerigk; Jannis Kurtz (CoRR, 2020)

Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. - Marc Goerigk; Jannis Kurtz; Michael Poss (Discret. Appl. Math., 2020)

Robust optimization for premarshalling with uncertain priority classes. - Sven Boge; Marc Goerigk; Sigrid Knust (Eur. J. Oper. Res., 2020)

Approximating combinatorial optimization problems with the ordered weighted averaging criterion. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2020)

Generating hard instances for robust combinatorial optimization. - Marc Goerigk; Stephen J. Maher (Eur. J. Oper. Res., 2020)

Mixed uncertainty sets for robust combinatorial optimization. - Trivikram Dokka; Marc Goerigk; Rahul Roy (Optim. Lett., 2020)

Two-stage combinatorial optimization problems under risk. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Theor. Comput. Sci., 2020)

A Phase I Simplex Method for Finding Feasible Periodic Timetables. - Marc Goerigk; Anita Schöbel; Felix Spühler (ATMOS, 2021)

Combinatorial two-stage minmax regret problems under interval uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Ann. Oper. Res., 2021)

A compact reformulation of the two-stage robust resource-constrained project scheduling problem. - Matthew Bold; Marc Goerigk (Comput. Oper. Res., 2021)

Multistage robust discrete optimization via quantified integer programming. - Marc Goerigk; Michael Hartisch (Comput. Oper. Res., 2021)

Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming. - Martin Hughes; Marc Goerigk; Trivikram Dokka (Comput. Oper. Res., 2021)

Recoverable Robust Single Machine Scheduling with Interval Uncertainty. - Matthew Bold; Marc Goerigk (CoRR, 2021)

On the Recoverable Traveling Salesman Problem. - Marc Goerigk; Stefan Lendl; Lasse Wulf (CoRR, 2021)

On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. - André B. Chassein; Marc Goerigk (Discret. Appl. Math., 2021)

Robust Combinatorial Optimization with Locally Budgeted Uncertainty. - Marc Goerigk; Stefan Lendl (Open J. Math. Optim., 2021)

Data-driven Prediction of Relevant Scenarios for Robust Optimization. - Marc Goerigk; Jannis Kurtz (CoRR, 2022)

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. - Marc Goerigk; Stefan Lendl; Lasse Wulf (CoRR, 2022)

Investigating the recoverable robust single machine scheduling problem under interval uncertainty. - Matthew Bold; Marc Goerigk (Discret. Appl. Math., 2022)

Two-Stage robust optimization problems with two-stage uncertainty. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Eur. J. Oper. Res., 2022)

Recoverable robust representatives selection problems with discrete budgeted uncertainty. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Eur. J. Oper. Res., 2022)

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (J. Comb. Optim., 2022)

A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. - Matthew Bold; Marc Goerigk (Oper. Res. Lett., 2022)

Data-driven robust optimization using deep neural networks. - Marc Goerigk; Jannis Kurtz (Comput. Oper. Res., 2023)

Combinatorial optimization problems with balanced regret. - Marc Goerigk; Michael Hartisch (Discret. Appl. Math., 2023)

Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. - Trivikram Dokka; Marc Goerigk (Comput. Oper. Res., 2023)

Robust optimization with belief functions. - Marc Goerigk; Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (Int. J. Approx. Reason., 2023)

Introducing TimPassLib - A Library for Integrated Periodic Timetabling and Passenger Routing. - Philine Schiewe; Marc Goerigk; Niels Lindner (Oper. Res. Forum, 2023)

Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective. - Marc Goerigk; Mohammad Khosravi (Eur. J. Oper. Res., 2023)

A framework for inherently interpretable optimization models. - Marc Goerigk; Michael Hartisch (Eur. J. Oper. Res., 2023)

A Framework for Data-Driven Explainability in Mathematical Optimization. - Kevin-Martin Aigner; Marc Goerigk; Michael Hartisch; Frauke Liers; Arthur Miehlich (AAAI, 2024)

Benchmarking problems for robust discrete optimization. - Marc Goerigk; Mohammad Khosravi (Comput. Oper. Res., 2024)

Feature-Based Interpretable Surrogates for Optimization. - Marc Goerigk; Michael Hartisch; Sebastian Merten; Kartikey Sharma (CoRR, 2024)

Towards Robust Interpretable Surrogates for Optimization. - Marc Goerigk; Michael Hartisch; Sebastian Merten (CoRR, 2024)

A preference elicitation approach for the ordered weighted averaging criterion using solution choice observations. - Werner Baak; Marc Goerigk; Michael Hartisch (Eur. J. Oper. Res., 2024)

On the complexity of robust multi-stage problems with discrete recourse. - Marc Goerigk; Stefan Lendl; Lasse Wulf (Discret. Appl. Math., 2024)

Data-driven prediction of relevant scenarios for robust combinatorial optimization. - Marc Goerigk; Jannis Kurtz (Comput. Oper. Res., 2025)

Robust min-max (regret) optimization using ordered weighted averaging. - Werner Baak; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2025)

Connections between Robust and Bilevel Optimization. - Marc Goerigk; Jannis Kurtz; Martin Schmidt 003; Johannes Thürauf (Open J. Math. Optim., 2025)

Retrieval optimization in a warehouse with multiple input/output-points. - Jan-Niklas Buckow; Marc Goerigk; Sigrid Knust (OR Spectr., 2025)

Robust combinatorial optimization problems under budgeted interdiction uncertainty. - Marc Goerigk; Mohammad Khosravi (OR Spectr., 2025)

Recoverable robust single machine scheduling with polyhedral uncertainty. - Matthew Bold; Marc Goerigk (J. Sched., 2025)