Marc Goerigk - RankMe

118 papers A* 2B 1C 9Journal 102Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR Marc Goerigk, Dorothee Henke, Lasse Wulf
2026	J	`jnl`	The robust selection problem with information discovery. Discret. Appl. Math. Xiaoyu Chen, Marc Goerigk, Michael Poss
2025	J	`jnl`	Connections between Robust and Bilevel Optimization. Open J. Math. Optim. Marc Goerigk, Jannis Kurtz, Martin Schmidt, Johannes Thürauf
2025	J	`jnl`	Data-driven prediction of relevant scenarios for robust combinatorial optimization. Comput. Oper. Res. Marc Goerigk, Jannis Kurtz
2025	J	`jnl`	Integrated pallet retrieval and processing in warehouses under uncertainty. OR Spectr. Jan-Niklas Buckow, Marc Goerigk, Sigrid Knust
2025	J	`jnl`	Recoverable robust single machine scheduling with polyhedral uncertainty. J. Sched. Matthew Bold, Marc Goerigk
2025	J	`jnl`	Retrieval optimization in a warehouse with multiple input/output-points. OR Spectr. Jan-Niklas Buckow, Marc Goerigk, Sigrid Knust
2025	J	`jnl`	Robust combinatorial optimization problems under budgeted interdiction uncertainty. OR Spectr. Marc Goerigk, Mohammad Khosravi
2025	J	`jnl`	Robust min-max (regret) optimization using ordered weighted averaging. Eur. J. Oper. Res. Werner Baak, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2024	A*	`conf`	A Framework for Data-Driven Explainability in Mathematical Optimization. AAAI Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich
2024	—	`conf`	A New Formulation for the Collection and Delivery Problem of Biomedical Specimen. OR Luis Aurelio Rocha, Alena Otto, Marc Goerigk
2024	J	`jnl`	A preference elicitation approach for the ordered weighted averaging criterion using solution choice observations. Eur. J. Oper. Res. Werner Baak, Marc Goerigk, Michael Hartisch
2024	J	`jnl`	Benchmarking problems for robust discrete optimization. Comput. Oper. Res. Marc Goerigk, Mohammad Khosravi
2024	J	`jnl`	Feature-Based Interpretable Surrogates for Optimization. CoRR Marc Goerigk, Michael Hartisch, Sebastian Merten, Kartikey Sharma
2024	J	`jnl`	On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. Marc Goerigk, Stefan Lendl, Lasse Wulf
2024	J	`jnl`	Towards Robust Interpretable Surrogates for Optimization. CoRR Marc Goerigk, Michael Hartisch, Sebastian Merten
2023	J	`jnl`	A Framework for Data-Driven Explainability in Mathematical Optimization. CoRR Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich
2023	J	`jnl`	A framework for inherently interpretable optimization models. Eur. J. Oper. Res. Marc Goerigk, Michael Hartisch
2023	J	`jnl`	Combinatorial optimization problems with balanced regret. Discret. Appl. Math. Marc Goerigk, Michael Hartisch
2023	J	`jnl`	Data-driven robust optimization using deep neural networks. Comput. Oper. Res. Marc Goerigk, Jannis Kurtz
2023	J	`jnl`	Introducing TimPassLib - A Library for Integrated Periodic Timetabling and Passenger Routing. Oper. Res. Forum Philine Schiewe, Marc Goerigk, Niels Lindner
2023	J	`jnl`	Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. Comput. Oper. Res. Trivikram Dokka, Marc Goerigk
2023	J	`jnl`	Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective. Eur. J. Oper. Res. Marc Goerigk, Mohammad Khosravi
2023	J	`jnl`	Robust optimization with belief functions. CoRR Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
2023	J	`jnl`	Robust optimization with belief functions. Int. J. Approx. Reason. Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
2022	J	`jnl`	A Framework for Inherently Interpretable Optimization Models. CoRR Marc Goerigk, Michael Hartisch
2022	J	`jnl`	A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. CoRR Matthew Bold, Marc Goerigk
2022	J	`jnl`	A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Oper. Res. Lett. Matthew Bold, Marc Goerigk
2022	J	`jnl`	Benchmarking Problems for Robust Discrete Optimization. CoRR Marc Goerigk, Mohammad Khosravi
2022	J	`jnl`	Data-driven Prediction of Relevant Scenarios for Robust Optimization. CoRR Marc Goerigk, Jannis Kurtz
2022	J	`jnl`	Investigating the recoverable robust single machine scheduling problem under interval uncertainty. Discret. Appl. Math. Matthew Bold, Marc Goerigk
2022	J	`jnl`	On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2022	J	`jnl`	Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. Marc Goerigk, Stefan Lendl, Lasse Wulf
2022	J	`jnl`	Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. J. Comb. Optim. Marc Goerigk, Adam Kasperski, Pawel Zielinski
2022	J	`jnl`	Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. Marc Goerigk, Stefan Lendl, Lasse Wulf
2021	C	`conf`	A Phase I Simplex Method for Finding Feasible Periodic Timetables. ATMOS Marc Goerigk, Anita Schöbel, Felix Spühler
2021	J	`jnl`	A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Comput. Oper. Res. Matthew Bold, Marc Goerigk
2021	J	`jnl`	Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming. Comput. Oper. Res. Martin Hughes, Marc Goerigk, Trivikram Dokka
2021	J	`jnl`	Combinatorial Optimization Problems with Balanced Regret. CoRR Marc Goerigk, Michael Hartisch
2021	J	`jnl`	Combinatorial two-stage minmax regret problems under interval uncertainty. Ann. Oper. Res. Marc Goerigk, Adam Kasperski, Pawel Zielinski
2021	J	`jnl`	Multistage robust discrete optimization via quantified integer programming. Comput. Oper. Res. Marc Goerigk, Michael Hartisch
2021	J	`jnl`	On the Recoverable Traveling Salesman Problem. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2021	J	`jnl`	On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discret. Appl. Math. André B. Chassein, Marc Goerigk
2021	J	`jnl`	Recoverable Robust Single Machine Scheduling with Interval Uncertainty. CoRR Matthew Bold, Marc Goerigk
2021	J	`jnl`	Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. Marc Goerigk, Stefan Lendl
2021	J	`jnl`	Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2020	J	`jnl`	A compact reformulation of the two-stage robust resource-constrained project scheduling problem. CoRR Matthew Bold, Marc Goerigk
2020	J	`jnl`	Approximating combinatorial optimization problems with the ordered weighted averaging criterion. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2020	J	`jnl`	Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems. CoRR Martin Hughes, Marc Goerigk, Trivikram Dokka
2020	J	`jnl`	Combinatorial two-stage minmax regret problems under interval uncertainty. CoRR Marc Goerigk, Adam Kasperski, Pawel Zielinski
2020	J	`jnl`	Data-Driven Robust Optimization using Unsupervised Deep Learning. CoRR Marc Goerigk, Jannis Kurtz
2020	J	`jnl`	Generating hard instances for robust combinatorial optimization. Eur. J. Oper. Res. Marc Goerigk, Stephen J. Maher
2020	J	`jnl`	Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. Discret. Appl. Math. Marc Goerigk, Jannis Kurtz, Michael Poss
2020	J	`jnl`	Mixed uncertainty sets for robust combinatorial optimization. Optim. Lett. Trivikram Dokka, Marc Goerigk, Rahul Roy
2020	J	`jnl`	Particle swarm metaheuristics for robust optimisation with implementation uncertainty. Comput. Oper. Res. Martin Hughes, Marc Goerigk, Trivikram Dokka
2020	J	`jnl`	Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR Marc Goerigk, Stefan Lendl, Lasse Wulf
2020	J	`jnl`	Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty. CoRR Matthew Bold, Marc Goerigk
2020	J	`jnl`	Robust optimization for premarshalling with uncertain priority classes. Eur. J. Oper. Res. Sven Boge, Marc Goerigk, Sigrid Knust
2020	J	`jnl`	Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. Marc Goerigk, Adam Kasperski, Pawel Zielinski
2019	J	`jnl`	A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. Comput. Oper. Res. Martin Hughes, Marc Goerigk, Michael Wright
2019	J	`jnl`	Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. André B. Chassein, Trivikram Dokka, Marc Goerigk
2019	J	`jnl`	Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss
2019	J	`jnl`	Flexible here-and-now decisions for two-stage multi-objective optimization: Method and application to energy system design selection. CoRR Dinah Elena Hollermann, Marc Goerigk, Dörthe Franzisca Hoffrogge, Maike Hennen, André Bardow
2019	J	`jnl`	On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett. André B. Chassein, Marc Goerigk
2019	J	`jnl`	Representative scenario construction and preprocessing for robust combinatorial optimization problems. Optim. Lett. Marc Goerigk, Martin Hughes
2019	C	`conf`	Robust Network Capacity Expansion with Non-Linear Costs. ATMOS Francis Garuba, Marc Goerigk, Peter Jacko
2019	J	`jnl`	Robust two-stage combinatorial optimization problems under convex uncertainty. CoRR Marc Goerigk, Adam Kasperski, Pawel Zielinski
2019	—	`conf`	Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. OR Marc Goerigk, Adam Kasperski, Pawel Zielinski
2019	J	`jnl`	The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods. CoRR Trivikram Dokka, Marc Goerigk
2018	J	`jnl`	Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2018	J	`jnl`	Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk
2018	J	`jnl`	Generating Hard Instances for Robust Combinatorial Optimization. CoRR Marc Goerigk, Stephen J. Maher
2018	J	`jnl`	Mixed Uncertainty Sets for Robust Combinatorial Optimization. CoRR Trivikram Dokka, Marc Goerigk, Rahul Roy
2018	J	`jnl`	On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2018	J	`jnl`	On scenario aggregation to approximate robust combinatorial optimization problems. Optim. Lett. André B. Chassein, Marc Goerigk
2018	J	`jnl`	Ranking robustness and its application to evacuation planning. Eur. J. Oper. Res. Marc Goerigk, Horst W. Hamacher, Anika Kinscherff
2018	J	`jnl`	The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk
2018	J	`jnl`	Two-stage Combinatorial Optimization Problems under Risk. CoRR Marc Goerigk, Adam Kasperski, Pawel Zielinski
2018	J	`jnl`	Variable-sized uncertainty and inverse problems in robust optimization. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk
2017	J	`jnl`	A biobjective approach to recoverable robustness based on location planning. Eur. J. Oper. Res. Emilio Carrizosa, Marc Goerigk, Anita Schöbel
2017	C	`conf`	An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. ATMOS Trivikram Dokka, Marc Goerigk
2017	J	`jnl`	An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. CoRR Trivikram Dokka, Marc Goerigk
2017	C	`conf`	An Improved Algorithm for the Periodic Timetabling Problem. ATMOS Marc Goerigk, Christian Liebchen
2017	J	`jnl`	Line planning with user-optimal route choice. Eur. J. Oper. Res. Marc Goerigk, Marie Schmidt
2017	J	`jnl`	Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk
2017	J	`jnl`	On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2016	C	`ed.`	16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2016, Aarhus, Denmark, August 25, 2016 ATMOS Marc Goerigk, Renato F. Werneck
2016	J	`jnl`	A bicriteria approach to robust optimization. Comput. Oper. Res. André B. Chassein, Marc Goerigk
2016	J	`jnl`	A combined local search and integer programming approach to the traveling tournament problem. Ann. Oper. Res. Marc Goerigk, Stephan Westphal
2016	—	`ch.`	Algorithm Engineering in Robust Optimization. Algorithm Engineering Marc Goerigk, Anita Schöbel
2016	J	`jnl`	Improvable Knapsack Problems. CoRR Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
2016	J	`jnl`	On Scenario Aggregation to Approximate Robust Optimization Problems. CoRR Marc Goerigk, André B. Chassein
2016	J	`jnl`	On the recoverable robust traveling salesman problem. Optim. Lett. André B. Chassein, Marc Goerigk
2016	J	`jnl`	Robust flows with losses and improvability in evacuation planning. EURO J. Comput. Optim. Marc Goerigk, Ismaila Abderhamane Ndiaye
2016	J	`jnl`	Robust storage loading problems with stacking and payload constraints. Eur. J. Oper. Res. Marc Goerigk, Sigrid Knust, Xuan Thanh Le
2016	J	`jnl`	SI: disaster risk management. EURO J. Comput. Optim. Marc Goerigk, Horst W. Hamacher
2015	J	`jnl`	A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. André B. Chassein, Marc Goerigk
2015	J	`jnl`	Algorithm Engineering in Robust Optimization. CoRR Marc Goerigk, Anita Schöbel
2015	J	`jnl`	Alternative formulations for the ordered weighted averaging objective. Inf. Process. Lett. André B. Chassein, Marc Goerigk
2015	J	`jnl`	Exact and heuristic approaches to the robust periodic event scheduling problem. Public Transp. Marc Goerigk
2015	J	`jnl`	The robust knapsack problem with queries. Comput. Oper. Res. Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen
2014	J	`jnl`	A note on upper bounds to the robust knapsack problem with discrete scenarios. Ann. Oper. Res. Marc Goerigk
2014	J	`jnl`	A robust bus evacuation model with delayed scenario information. OR Spectr. Marc Goerigk, Bob Grün
2014	C	`conf`	Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen
2014	J	`jnl`	ROPI - a robust optimization programming interface for C++. Optim. Methods Softw. Marc Goerigk
2014	J	`jnl`	Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling. Comput. Oper. Res. Marc Goerigk, Anita Schöbel
2014	J	`jnl`	Robust load planning of trains in intermodal transportation. OR Spectr. Florian Bruns, Marc Goerigk, Sigrid Knust, Anita Schöbel
2014	A*	`conf`	Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal
2014	J	`jnl`	The Price of Strict and Light Robustness in Timetable Information. Transp. Sci. Marc Goerigk, Marie Schmidt, Anita Schöbel, Martin Knoth, Matthias Müller-Hannemann
2013	J	`jnl`	An experimental comparison of periodic timetabling models. Comput. Oper. Res. Michael Siebert, Marc Goerigk
2013	J	`jnl`	Branch and bound algorithms for the bus evacuation problem. Comput. Oper. Res. Marc Goerigk, Bob Grün, Philipp Heßler
2013	J	`jnl`	Evaluating line concepts using travel times and robustness. Public Transp. Marc Goerigk, Michael Schachtebeck, Anita Schöbel
2013	J	`jnl`	Improving the modulo simplex algorithm for large-scale periodic timetabling. Comput. Oper. Res. Marc Goerigk, Anita Schöbel
2013	C	`conf`	Recoverable Robust Timetable Information. ATMOS Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel
2011	—	`conf`	A Scenario-Based Approach for Robust Linear Optimization. TAPAS Marc Goerigk, Anita Schöbel
2011	B	`conf`	Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. SEA Marc Goerigk, Anita Schöbel
2011	C	`conf`	The Price of Robustness in Timetable Information. ATMOS Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel
2010	C	`conf`	An Empirical Analysis of Robustness Concepts for Timetabling. ATMOS Marc Goerigk, Anita Schöbel