Marc Goerigk

From MaRDI portal
Person:284437

Available identifiers

zbMath Open goerigk.marcWikidataQ57238291 ScholiaQ57238291MaRDI QIDQ284437

List of research outcomes





PublicationDate of PublicationType
A phase I simplex method for finding feasible periodic timetables2024-08-13Paper
An improved algorithm for the periodic timetabling problem2024-07-11Paper
An experimental comparison of uncertainty sets for robust shortest path problems2024-07-11Paper
Benchmarking problems for robust discrete optimization2024-07-08Paper
On the complexity of robust multi-stage problems with discrete recourse2024-01-02Paper
Introducing TimPassLib -- a library for integrated periodic timetabling and passenger routing2023-10-05Paper
Robust optimization with belief functions2023-07-18Paper
Robust Combinatorial Optimization Problems Under Budgeted Interdiction Uncertainty2023-07-17Paper
A framework for inherently interpretable optimization models2023-07-11Paper
Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations2023-07-04Paper
Data-driven robust optimization using deep neural networks2023-07-04Paper
Combinatorial optimization problems with balanced regret2023-02-22Paper
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem2022-10-17Paper
Robust combinatorial optimization with locally budgeted uncertainty2022-08-20Paper
Recoverable robust representatives selection problems with discrete budgeted uncertainty2022-07-22Paper
A Preference Elicitation Approach for the Ordered Weighted Averaging Criterion using Solution Choice Observations2022-06-02Paper
Two-stage robust optimization problems with two-stage uncertainty2022-05-20Paper
Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection2022-05-17Paper
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty2022-04-13Paper
Investigating the recoverable robust single machine scheduling problem under interval uncertainty2022-03-28Paper
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem2022-03-14Paper
Multistage robust discrete optimization via quantified integer programming2022-03-09Paper
Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming2022-03-07Paper
A compact reformulation of the two-stage robust resource-constrained project scheduling problem2022-03-07Paper
Combinatorial Optimization Problems with Balanced Regret2021-11-24Paper
Combinatorial two-stage minmax regret problems under interval uncertainty2021-11-08Paper
Solving robust two-stage combinatorial optimization problems under convex uncertainty2021-08-30Paper
Investigating the Recoverable Robust Single Machine Scheduling Problem Under Interval Uncertainty2021-07-20Paper
Particle swarm metaheuristics for robust optimisation with implementation uncertainty2021-04-20Paper
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty2021-04-20Paper
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty2021-04-07Paper
Multistage Robust Discrete Optimization via Quantified Integer Programming2020-09-25Paper
Robust Optimization Approaches for Routing and Scheduling of Multi-Skilled Teams under Uncertain Job Skill Requirements2020-09-09Paper
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty2020-08-31Paper
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty2020-08-28Paper
Mixed uncertainty sets for robust combinatorial optimization2020-08-24Paper
Approximating combinatorial optimization problems with the ordered weighted averaging criterion2020-06-17Paper
Robust optimization for premarshalling with uncertain priority classes2020-06-17Paper
Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems2020-04-15Paper
A compact reformulation of the two-stage robust resource-constrained project scheduling problem2020-04-14Paper
An Efficient Approach to Distributionally Robust Network Capacity Planning2020-04-09Paper
A Comparison of Discrete and Polyhedral Uncertainty Sets for Robust Network Design2020-03-23Paper
On the complexity of robust geometric programming with polyhedral uncertainty2020-02-10Paper
Two-stage combinatorial optimization problems under risk2019-12-27Paper
Representative scenario construction and preprocessing for robust combinatorial optimization problems2019-10-18Paper
Generating hard instances for robust combinatorial optimization2019-09-09Paper
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty2019-07-05Paper
A Comparison of Models for Uncertain Network Design2019-01-11Paper
Algorithms and uncertainty sets for data-driven robust shortest path problems2018-12-18Paper
On scenario aggregation to approximate robust combinatorial optimization problems2018-10-23Paper
The quadratic shortest path problem: complexity, approximability, and solution methods2018-05-30Paper
A biobjective approach to recoverable robustness based on location planning2018-05-29Paper
Line planning with user-optimal route choice2018-05-25Paper
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty2018-05-22Paper
Constructing Representative Scenarios to Approximate Robust Combinatorial Optimization Problems2018-02-27Paper
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets2018-02-16Paper
Variable-sized uncertainty and inverse problems in robust optimization2018-02-01Paper
On recoverable and two-stage robust selection problems with budgeted uncertainty2017-11-23Paper
Ranking robustness and its application to evacuation planning2017-11-23Paper
Improving the modulo simplex algorithm for large-scale periodic timetabling2017-01-05Paper
A bicriteria approach to robust optimization2016-11-17Paper
Robust flows with losses and improvability in evacuation planning2016-11-11Paper
An experimental comparison of periodic timetabling models2016-11-10Paper
Branch and bound algorithms for the bus evacuation problem2016-11-10Paper
Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling2016-11-10Paper
The robust knapsack problem with queries2016-11-10Paper
On the recoverable robust traveling salesman problem2016-10-27Paper
Robust storage loading problems with stacking and payload constraints2016-10-07Paper
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem2016-10-06Paper
A combined local search and integer programming approach to the traveling tournament problem2016-05-18Paper
Alternative formulations for the ordered weighted averaging objective2015-05-21Paper
A note on upper bounds to the robust knapsack problem with discrete scenarios2015-02-27Paper
Robust load planning of trains in intermodal transportation2014-12-11Paper
A robust bus evacuation model with delayed scenario information2014-12-11Paper
ROPI—a robust optimization programming interface for C++2014-10-29Paper
https://portal.mardi4nfdi.de/entity/Q51709332014-07-25Paper
Approximation Algorithms for the Weight-Reducible Knapsack Problem2014-04-16Paper
Recoverable Robust Timetable Information2014-02-24Paper
An empirical analysis of robustness concepts for timetabling2012-09-28Paper
The price of robustness in timetable information2012-09-28Paper
A Scenario-Based Approach for Robust Linear Optimization2011-05-12Paper
Robust Min-Max (Regret) Optimization using Ordered Weighted AveragingN/APaper

Research outcomes over time

This page was built for person: Marc Goerigk