Marc Goerigk

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 82

Top Venues

Publications

Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich
A Framework for Data-Driven Explainability in Mathematical Optimization. AAAI (2024)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343 (2024)
Werner Baak, Marc Goerigk, Michael Hartisch
A preference elicitation approach for the ordered weighted averaging criterion using solution choice observations. Eur. J. Oper. Res. 314 (3) (2024)
Marc Goerigk, Mohammad Khosravi
Benchmarking problems for robust discrete optimization. Comput. Oper. Res. 166 (2024)
Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust optimization with belief functions. Int. J. Approx. Reason. 159 (2023)
Marc Goerigk, Michael Hartisch
A framework for inherently interpretable optimization models. Eur. J. Oper. Res. 310 (3) (2023)
Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich
A Framework for Data-Driven Explainability in Mathematical Optimization. CoRR (2023)
Marc Goerigk, Mohammad Khosravi
Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective. Eur. J. Oper. Res. 310 (2) (2023)
Marc Goerigk, Jannis Kurtz
Data-driven robust optimization using deep neural networks. Comput. Oper. Res. 151 (2023)
Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust optimization with belief functions. CoRR (2023)
Marc Goerigk, Michael Hartisch
Combinatorial optimization problems with balanced regret. Discret. Appl. Math. 328 (2023)
Trivikram Dokka, Marc Goerigk
Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. Comput. Oper. Res. 154 (2023)
Philine Schiewe, Marc Goerigk, Niels Lindner
Introducing TimPassLib - A Library for Integrated Periodic Timetabling and Passenger Routing. Oper. Res. Forum 4 (3) (2023)
Matthew Bold, Marc Goerigk
Investigating the recoverable robust single machine scheduling problem under interval uncertainty. Discret. Appl. Math. 313 (2022)
Marc Goerigk, Michael Hartisch
A Framework for Inherently Interpretable Optimization Models. CoRR (2022)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. J. Comb. Optim. 43 (3) (2022)
Matthew Bold, Marc Goerigk
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Oper. Res. Lett. 50 (5) (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. 303 (2) (2022)
Matthew Bold, Marc Goerigk
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. CoRR (2022)
Marc Goerigk, Mohammad Khosravi
Benchmarking Problems for Robust Discrete Optimization. CoRR (2022)
Marc Goerigk, Jannis Kurtz
Data-driven Prediction of Relevant Scenarios for Robust Optimization. CoRR (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR (2022)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302 (1) (2022)
Martin Hughes, Marc Goerigk, Trivikram Dokka
Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming. Comput. Oper. Res. 133 (2021)
André B. Chassein, Marc Goerigk
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discret. Appl. Math. 296 (2021)
Matthew Bold, Marc Goerigk
Recoverable Robust Single Machine Scheduling with Interval Uncertainty. CoRR (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR (2021)
Marc Goerigk, Anita Schöbel, Felix Spühler
A Phase I Simplex Method for Finding Feasible Periodic Timetables. ATMOS (2021)
Marc Goerigk, Stefan Lendl
Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. 2 (2021)
Matthew Bold, Marc Goerigk
A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Comput. Oper. Res. 130 (2021)
Marc Goerigk, Michael Hartisch
Combinatorial Optimization Problems with Balanced Regret. CoRR (2021)
Marc Goerigk, Stefan Lendl, Lasse Wulf
On the Recoverable Traveling Salesman Problem. CoRR (2021)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Combinatorial two-stage minmax regret problems under interval uncertainty. Ann. Oper. Res. 300 (1) (2021)
Marc Goerigk, Michael Hartisch
Multistage robust discrete optimization via quantified integer programming. Comput. Oper. Res. 135 (2021)
Matthew Bold, Marc Goerigk
A compact reformulation of the two-stage robust resource-constrained project scheduling problem. CoRR (2020)
Matthew Bold, Marc Goerigk
Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty. CoRR (2020)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Combinatorial two-stage minmax regret problems under interval uncertainty. CoRR (2020)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. 804 (2020)
Marc Goerigk, Jannis Kurtz
Data-Driven Robust Optimization using Unsupervised Deep Learning. CoRR (2020)
Sven Boge, Marc Goerigk, Sigrid Knust
Robust optimization for premarshalling with uncertain priority classes. Eur. J. Oper. Res. 287 (1) (2020)
Marc Goerigk, Jannis Kurtz, Michael Poss
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. Discret. Appl. Math. 285 (2020)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
Approximating combinatorial optimization problems with the ordered weighted averaging criterion. Eur. J. Oper. Res. 286 (3) (2020)
Martin Hughes, Marc Goerigk, Trivikram Dokka
Particle swarm metaheuristics for robust optimisation with implementation uncertainty. Comput. Oper. Res. 122 (2020)
Trivikram Dokka, Marc Goerigk, Rahul Roy
Mixed uncertainty sets for robust combinatorial optimization. Optim. Lett. 14 (6) (2020)
Marc Goerigk, Stephen J. Maher
Generating hard instances for robust combinatorial optimization. Eur. J. Oper. Res. 280 (1) (2020)
Martin Hughes, Marc Goerigk, Trivikram Dokka
Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems. CoRR (2020)
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR (2020)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Robust two-stage combinatorial optimization problems under convex uncertainty. CoRR (2019)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. OR (2019)
Martin Hughes, Marc Goerigk, Michael Wright
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. Comput. Oper. Res. 103 (2019)
Dinah Elena Hollermann, Marc Goerigk, Dörthe Franzisca Hoffrogge, Maike Hennen, André Bardow
Flexible here-and-now decisions for two-stage multi-objective optimization: Method and application to energy system design selection. CoRR (2019)
Trivikram Dokka, Marc Goerigk
The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods. CoRR (2019)
André B. Chassein, Trivikram Dokka, Marc Goerigk
Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. 274 (2) (2019)
Francis Garuba, Marc Goerigk, Peter Jacko
Robust Network Capacity Expansion with Non-Linear Costs. ATMOS (2019)
André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. 279 (2) (2019)
André B. Chassein, Marc Goerigk
On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett. 47 (1) (2019)
Marc Goerigk, Martin Hughes
Representative scenario construction and preprocessing for robust combinatorial optimization problems. Optim. Lett. 13 (6) (2019)
André B. Chassein, Marc Goerigk
On scenario aggregation to approximate robust combinatorial optimization problems. Optim. Lett. 12 (7) (2018)
André B. Chassein, Marc Goerigk
Variable-sized uncertainty and inverse problems in robust optimization. Eur. J. Oper. Res. 264 (1) (2018)
Trivikram Dokka, Marc Goerigk, Rahul Roy
Mixed Uncertainty Sets for Robust Combinatorial Optimization. CoRR (2018)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Two-stage Combinatorial Optimization Problems under Risk. CoRR (2018)
André B. Chassein, Marc Goerigk
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. Eur. J. Oper. Res. 269 (2) (2018)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR (2018)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. 265 (2) (2018)
Marc Goerigk, Horst W. Hamacher, Anika Kinscherff
Ranking robustness and its application to evacuation planning. Eur. J. Oper. Res. 264 (3) (2018)
Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk
The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268 (2) (2018)
Marc Goerigk, Stephen J. Maher
Generating Hard Instances for Robust Combinatorial Optimization. CoRR (2018)
Trivikram Dokka, Marc Goerigk
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. ATMOS (2017)
Marc Goerigk, Christian Liebchen
An Improved Algorithm for the Periodic Timetabling Problem. ATMOS (2017)
André B. Chassein, Marc Goerigk
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. Eur. J. Oper. Res. 258 (1) (2017)
Trivikram Dokka, Marc Goerigk
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. CoRR (2017)
Marc Goerigk, Marie Schmidt
Line planning with user-optimal route choice. Eur. J. Oper. Res. 259 (2) (2017)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR (2017)
Emilio Carrizosa, Marc Goerigk, Anita Schöbel
A biobjective approach to recoverable robustness based on location planning. Eur. J. Oper. Res. 261 (2) (2017)
Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
Improvable Knapsack Problems. CoRR (2016)
André B. Chassein, Marc Goerigk
On the recoverable robust traveling salesman problem. Optim. Lett. 10 (7) (2016)
Marc Goerigk, Stephan Westphal
A combined local search and integer programming approach to the traveling tournament problem. Ann. Oper. Res. 239 (1) (2016)
Marc Goerigk, André B. Chassein
On Scenario Aggregation to Approximate Robust Optimization Problems. CoRR (2016)
André B. Chassein, Marc Goerigk
A bicriteria approach to robust optimization. Comput. Oper. Res. 66 (2016)
Marc Goerigk, Horst W. Hamacher
SI: disaster risk management. EURO J. Comput. Optim. 4 (3-4) (2016)
Marc Goerigk, Ismaila Abderhamane Ndiaye
Robust flows with losses and improvability in evacuation planning. EURO J. Comput. Optim. 4 (3-4) (2016)
Marc Goerigk, Sigrid Knust, Xuan Thanh Le
Robust storage loading problems with stacking and payload constraints. Eur. J. Oper. Res. 253 (1) (2016)
André B. Chassein, Marc Goerigk
Alternative formulations for the ordered weighted averaging objective. Inf. Process. Lett. 115 (6-8) (2015)
Marc Goerigk
Exact and heuristic approaches to the robust periodic event scheduling problem. Public Transp. 7 (1) (2015)
Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
The robust knapsack problem with queries. Comput. Oper. Res. 55 (2015)
André B. Chassein, Marc Goerigk
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. 244 (3) (2015)
Marc Goerigk, Anita Schöbel
Algorithm Engineering in Robust Optimization. CoRR (2015)
Marc Goerigk, Marie Schmidt, Anita Schöbel, Martin Knoth, Matthias Müller-Hannemann
The Price of Strict and Light Robustness in Timetable Information. Transp. Sci. 48 (2) (2014)
Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI (2014)
Marc Goerigk, Bob Grün
A robust bus evacuation model with delayed scenario information. OR Spectr. 36 (4) (2014)
Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC (2014)
Florian Bruns, Marc Goerigk, Sigrid Knust, Anita Schöbel
Robust load planning of trains in intermodal transportation. OR Spectr. 36 (3) (2014)
Marc Goerigk
A note on upper bounds to the robust knapsack problem with discrete scenarios. Ann. Oper. Res. 223 (1) (2014)
Marc Goerigk, Anita Schöbel
Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling. Comput. Oper. Res. 52 (2014)
Marc Goerigk
ROPI - a robust optimization programming interface for C++. Optim. Methods Softw. 29 (6) (2014)
Marc Goerigk, Bob Grün, Philipp Heßler
Branch and bound algorithms for the bus evacuation problem. Comput. Oper. Res. 40 (12) (2013)
Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel
Recoverable Robust Timetable Information. ATMOS (2013)
Michael Siebert, Marc Goerigk
An experimental comparison of periodic timetabling models. Comput. Oper. Res. 40 (10) (2013)
Marc Goerigk, Michael Schachtebeck, Anita Schöbel
Evaluating line concepts using travel times and robustness. Public Transp. 5 (3) (2013)
Marc Goerigk, Anita Schöbel
Improving the modulo simplex algorithm for large-scale periodic timetabling. Comput. Oper. Res. 40 (5) (2013)

Marc Goerigk.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marc Goerigk