default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Goerigk
Person information
- affiliation: Universität Passau, Germany
- affiliation (former): Universität Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j62]Marc Goerigk
, Mohammad Khosravi:
Benchmarking problems for robust discrete optimization. Comput. Oper. Res. 166: 106608 (2024)- [j61]Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343: 355-370 (2024) - [j60]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): 1098-1110 (2024) - [c13]Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich:
A Framework for Data-Driven Explainability in Mathematical Optimization. AAAI 2024: 20912-20920 - [i30]Marc Goerigk, Michael Hartisch, Sebastian Merten, Kartikey Sharma:
Feature-Based Interpretable Surrogates for Optimization. CoRR abs/2409.01869 (2024) - 2023
- [j59]Marc Goerigk, Jannis Kurtz:
Data-driven robust optimization using deep neural networks. Comput. Oper. Res. 151: 106087 (2023) - [j58]Trivikram Dokka, Marc Goerigk:
Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations. Comput. Oper. Res. 154: 106213 (2023) - [j57]Marc Goerigk, Michael Hartisch:
Combinatorial optimization problems with balanced regret. Discret. Appl. Math. 328: 40-59 (2023) - [j56]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): 529-551 (2023) - [j55]Marc Goerigk, Michael Hartisch:
A framework for inherently interpretable optimization models. Eur. J. Oper. Res. 310(3): 1312-1324 (2023) - [j54]Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust optimization with belief functions. Int. J. Approx. Reason. 159: 108941 (2023) - [j53]Philine Schiewe, Marc Goerigk, Niels Lindner:
Introducing TimPassLib - A Library for Integrated Periodic Timetabling and Passenger Routing. Oper. Res. Forum 4(3): 64 (2023) - [i29]Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust optimization with belief functions. CoRR abs/2303.05067 (2023) - [i28]Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich:
A Framework for Data-Driven Explainability in Mathematical Optimization. CoRR abs/2308.08309 (2023) - 2022
- [j52]Matthew Bold, Marc Goerigk:
Investigating the recoverable robust single machine scheduling problem under interval uncertainty. Discret. Appl. Math. 313: 99-114 (2022) - [j51]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Two-Stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302(1): 62-78 (2022) - [j50]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Recoverable robust representatives selection problems with discrete budgeted uncertainty. Eur. J. Oper. Res. 303(2): 567-580 (2022) - [j49]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. J. Comb. Optim. 43(3): 497-527 (2022) - [j48]Matthew Bold, Marc Goerigk:
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Oper. Res. Lett. 50(5): 581-587 (2022) - [i27]Marc Goerigk, Mohammad Khosravi:
Benchmarking Problems for Robust Discrete Optimization. CoRR abs/2201.04985 (2022) - [i26]Matthew Bold, Marc Goerigk:
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. CoRR abs/2203.06983 (2022) - [i25]Marc Goerigk, Jannis Kurtz:
Data-driven Prediction of Relevant Scenarios for Robust Optimization. CoRR abs/2203.16642 (2022) - [i24]Marc Goerigk, Michael Hartisch:
A Framework for Inherently Interpretable Optimization Models. CoRR abs/2208.12570 (2022) - [i23]Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy. CoRR abs/2209.01011 (2022) - 2021
- [j47]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Combinatorial two-stage minmax regret problems under interval uncertainty. Ann. Oper. Res. 300(1): 23-50 (2021) - [j46]Matthew Bold, Marc Goerigk:
A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Comput. Oper. Res. 130: 105232 (2021) - [j45]Martin Hughes, Marc Goerigk, Trivikram Dokka:
Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming. Comput. Oper. Res. 133: 105364 (2021) - [j44]Marc Goerigk, Michael Hartisch:
Multistage robust discrete optimization via quantified integer programming. Comput. Oper. Res. 135: 105434 (2021) - [j43]André B. Chassein, Marc Goerigk:
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discret. Appl. Math. 296: 141-163 (2021) - [j42]Marc Goerigk, Stefan Lendl:
Robust Combinatorial Optimization with Locally Budgeted Uncertainty. Open J. Math. Optim. 2: 1-18 (2021) - [c12]Marc Goerigk, Anita Schöbel, Felix Spühler:
A Phase I Simplex Method for Finding Feasible Periodic Timetables. ATMOS 2021: 6:1-6:13 - [i22]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty. CoRR abs/2104.03043 (2021) - [i21]Matthew Bold, Marc Goerigk:
Recoverable Robust Single Machine Scheduling with Interval Uncertainty. CoRR abs/2107.09310 (2021) - [i20]Marc Goerigk, Stefan Lendl, Lasse Wulf:
On the Recoverable Traveling Salesman Problem. CoRR abs/2111.09691 (2021) - [i19]Marc Goerigk, Michael Hartisch:
Combinatorial Optimization Problems with Balanced Regret. CoRR abs/2111.12470 (2021) - 2020
- [j41]Martin Hughes, Marc Goerigk, Trivikram Dokka:
Particle swarm metaheuristics for robust optimisation with implementation uncertainty. Comput. Oper. Res. 122: 104998 (2020) - [j40]Marc Goerigk, Jannis Kurtz, Michael Poss:
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. Discret. Appl. Math. 285: 707-725 (2020) - [j39]Marc Goerigk, Stephen J. Maher:
Generating hard instances for robust combinatorial optimization. Eur. J. Oper. Res. 280(1): 34-45 (2020) - [j38]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): 828-838 (2020) - [j37]Sven Boge, Marc Goerigk, Sigrid Knust:
Robust optimization for premarshalling with uncertain priority classes. Eur. J. Oper. Res. 287(1): 191-210 (2020) - [j36]Trivikram Dokka, Marc Goerigk, Rahul Roy:
Mixed uncertainty sets for robust combinatorial optimization. Optim. Lett. 14(6): 1323-1337 (2020) - [j35]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. 804: 29-45 (2020) - [i18]Matthew Bold, Marc Goerigk:
A compact reformulation of the two-stage robust resource-constrained project scheduling problem. CoRR abs/2004.06547 (2020) - [i17]Martin Hughes, Marc Goerigk, Trivikram Dokka:
Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems. CoRR abs/2004.07294 (2020) - [i16]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Combinatorial two-stage minmax regret problems under interval uncertainty. CoRR abs/2005.10610 (2020) - [i15]Marc Goerigk, Stefan Lendl, Lasse Wulf:
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty. CoRR abs/2008.12727 (2020) - [i14]Matthew Bold, Marc Goerigk:
Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty. CoRR abs/2011.06284 (2020) - [i13]Marc Goerigk, Jannis Kurtz:
Data-Driven Robust Optimization using Unsupervised Deep Learning. CoRR abs/2011.09769 (2020)
2010 – 2019
- 2019
- [j34]Martin Hughes, Marc Goerigk, Michael Wright:
A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty. Comput. Oper. Res. 103: 64-80 (2019) - [j33]André B. Chassein, Trivikram Dokka, Marc Goerigk:
Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. 274(2): 671-686 (2019) - [j32]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): 308-319 (2019) - [j31]Marc Goerigk, Martin Hughes:
Representative scenario construction and preprocessing for robust combinatorial optimization problems. Optim. Lett. 13(6): 1417-1431 (2019) - [j30]André B. Chassein, Marc Goerigk:
On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett. 47(1): 21-24 (2019) - [c11]Francis Garuba, Marc Goerigk, Peter Jacko:
Robust Network Capacity Expansion with Non-Linear Costs. ATMOS 2019: 5:1-5:13 - [c10]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. OR 2019: 423-429 - [i12]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Robust two-stage combinatorial optimization problems under convex uncertainty. CoRR abs/1905.02469 (2019) - [i11]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 abs/1906.08621 (2019) - [i10]Trivikram Dokka, Marc Goerigk:
The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods. CoRR abs/1910.12504 (2019) - 2018
- [j29]André B. Chassein, Marc Goerigk:
Variable-sized uncertainty and inverse problems in robust optimization. Eur. J. Oper. Res. 264(1): 17-28 (2018) - [j28]Marc Goerigk, Horst W. Hamacher, Anika Kinscherff:
Ranking robustness and its application to evacuation planning. Eur. J. Oper. Res. 264(3): 837-846 (2018) - [j27]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): 423-436 (2018) - [j26]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): 473-485 (2018) - [j25]André B. Chassein, Marc Goerigk:
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. Eur. J. Oper. Res. 269(2): 544-555 (2018) - [j24]André B. Chassein, Marc Goerigk:
On scenario aggregation to approximate robust combinatorial optimization problems. Optim. Lett. 12(7): 1523-1533 (2018) - [i9]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR abs/1804.03594 (2018) - [i8]Marc Goerigk, Stephen J. Maher:
Generating Hard Instances for Robust Combinatorial Optimization. CoRR abs/1811.00824 (2018) - [i7]Trivikram Dokka, Marc Goerigk, Rahul Roy:
Mixed Uncertainty Sets for Robust Combinatorial Optimization. CoRR abs/1812.04895 (2018) - [i6]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Two-stage Combinatorial Optimization Problems under Risk. CoRR abs/1812.07826 (2018) - 2017
- [j23]André B. Chassein, Marc Goerigk:
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. Eur. J. Oper. Res. 258(1): 58-69 (2017) - [j22]Marc Goerigk, Marie Schmidt:
Line planning with user-optimal route choice. Eur. J. Oper. Res. 259(2): 424-436 (2017) - [j21]Emilio Carrizosa, Marc Goerigk, Anita Schöbel:
A biobjective approach to recoverable robustness based on location planning. Eur. J. Oper. Res. 261(2): 421-435 (2017) - [c9]Marc Goerigk, Christian Liebchen:
An Improved Algorithm for the Periodic Timetabling Problem. ATMOS 2017: 12:1-12:14 - [c8]Trivikram Dokka, Marc Goerigk:
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. ATMOS 2017: 16:1-16:13 - [i5]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR abs/1701.06064 (2017) - [i4]Trivikram Dokka, Marc Goerigk:
An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems. CoRR abs/1704.08470 (2017) - 2016
- [j20]Marc Goerigk, Stephan Westphal:
A combined local search and integer programming approach to the traveling tournament problem. Ann. Oper. Res. 239(1): 343-354 (2016) - [j19]André B. Chassein, Marc Goerigk:
A bicriteria approach to robust optimization. Comput. Oper. Res. 66: 181-189 (2016) - [j18]Marc Goerigk, Horst W. Hamacher:
SI: disaster risk management. EURO J. Comput. Optim. 4(3-4): 215-217 (2016) - [j17]Marc Goerigk, Ismaila Abderhamane Ndiaye:
Robust flows with losses and improvability in evacuation planning. EURO J. Comput. Optim. 4(3-4): 241-270 (2016) - [j16]Marc Goerigk, Sigrid Knust, Xuan Thanh Le:
Robust storage loading problems with stacking and payload constraints. Eur. J. Oper. Res. 253(1): 51-67 (2016) - [j15]André B. Chassein, Marc Goerigk:
On the recoverable robust traveling salesman problem. Optim. Lett. 10(7): 1479-1492 (2016) - [p1]Marc Goerigk, Anita Schöbel:
Algorithm Engineering in Robust Optimization. Algorithm Engineering 2016: 245-279 - [e1]Marc Goerigk, Renato F. Werneck:
16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2016, August 25, 2016, Aarhus, Denmark. OASIcs 54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-021-7 [contents] - [i3]Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Improvable Knapsack Problems. CoRR abs/1607.08338 (2016) - [i2]Marc Goerigk, André B. Chassein:
On Scenario Aggregation to Approximate Robust Optimization Problems. CoRR abs/1611.09754 (2016) - 2015
- [j14]Marc Goerigk, Manoj Gupta, Jonas Ide, Anita Schöbel, Sandeep Sen:
The robust knapsack problem with queries. Comput. Oper. Res. 55: 12-22 (2015) - [j13]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): 739-747 (2015) - [j12]André B. Chassein, Marc Goerigk:
Alternative formulations for the ordered weighted averaging objective. Inf. Process. Lett. 115(6-8): 604-608 (2015) - [j11]Marc Goerigk:
Exact and heuristic approaches to the robust periodic event scheduling problem. Public Transp. 7(1): 101-119 (2015) - [i1]Marc Goerigk, Anita Schöbel:
Algorithm Engineering in Robust Optimization. CoRR abs/1505.04901 (2015) - 2014
- [j10]Marc Goerigk:
A note on upper bounds to the robust knapsack problem with discrete scenarios. Ann. Oper. Res. 223(1): 461-469 (2014) - [j9]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: 1-15 (2014) - [j8]Marc Goerigk:
ROPI - a robust optimization programming interface for C++. Optim. Methods Softw. 29(6): 1261-1280 (2014) - [j7]Florian Bruns, Marc Goerigk, Sigrid Knust, Anita Schöbel:
Robust load planning of trains in intermodal transportation. OR Spectr. 36(3): 631-668 (2014) - [j6]Marc Goerigk, Bob Grün:
A robust bus evacuation model with delayed scenario information. OR Spectr. 36(4): 923-948 (2014) - [j5]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): 225-242 (2014) - [c7]Marc Goerigk, Richard Hoshino, Ken-ichi Kawarabayashi, Stephan Westphal:
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths. AAAI 2014: 2271-2277 - [c6]Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC 2014: 203-215 - 2013
- [j4]Marc Goerigk, Anita Schöbel:
Improving the modulo simplex algorithm for large-scale periodic timetabling. Comput. Oper. Res. 40(5): 1363-1370 (2013) - [j3]Michael Siebert, Marc Goerigk:
An experimental comparison of periodic timetabling models. Comput. Oper. Res. 40(10): 2251-2259 (2013) - [j2]Marc Goerigk, Bob Grün, Philipp Heßler:
Branch and bound algorithms for the bus evacuation problem. Comput. Oper. Res. 40(12): 3010-3020 (2013) - [j1]Marc Goerigk, Michael Schachtebeck, Anita Schöbel:
Evaluating line concepts using travel times and robustness. Public Transp. 5(3): 267-284 (2013) - [c5]Marc Goerigk, Sacha Heße, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel:
Recoverable Robust Timetable Information. ATMOS 2013: 1-14 - 2011
- [c4]Marc Goerigk, Martin Knoth, Matthias Müller-Hannemann, Marie Schmidt, Anita Schöbel:
The Price of Robustness in Timetable Information. ATMOS 2011: 76-87 - [c3]Marc Goerigk, Anita Schöbel:
A Scenario-Based Approach for Robust Linear Optimization. TAPAS 2011: 139-150 - [c2]Marc Goerigk, Anita Schöbel:
Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. SEA 2011: 181-192 - 2010
- [c1]Marc Goerigk, Anita Schöbel:
An Empirical Analysis of Robustness Concepts for Timetabling. ATMOS 2010: 100-113
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
