Marc Goerigk

Discret. Appl. Math., January, 2024

A Framework for Data-Driven Explainability in Mathematical Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

A framework for inherently interpretable optimization models.

[BibT_eX]

[DOI]

Michael Hartisch

Eur. J. Oper. Res., November, 2023

Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective.

[BibT_eX]

[DOI]

Mohammad Khosravi

Eur. J. Oper. Res., October, 2023

Introducing TimPassLib - A Library for Integrated Periodic Timetabling and Passenger Routing.

[BibT_eX]

[DOI]

Philine Schiewe

Niels Lindner

Oper. Res. Forum, September, 2023

Robust optimization with belief functions.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., August, 2023

Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations.

[BibT_eX]

[DOI]

Comput. Oper. Res., June, 2023

Combinatorial optimization problems with balanced regret.

[BibT_eX]

[DOI]

Michael Hartisch

Discret. Appl. Math., March, 2023

Data-driven robust optimization using deep neural networks.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2023

2022

A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Recoverable robust representatives selection problems with discrete budgeted uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Two-Stage robust optimization problems with two-stage uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Investigating the recoverable robust single machine scheduling problem under interval uncertainty.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy.

[BibT_eX]

[DOI]

CoRR, 2022

Data-driven Prediction of Relevant Scenarios for Robust Optimization.

[BibT_eX]

[DOI]

CoRR, 2022

Benchmarking Problems for Robust Discrete Optimization.

[BibT_eX]

[DOI]

Mohammad Khosravi

CoRR, 2022

2021

Robust Combinatorial Optimization with Locally Budgeted Uncertainty.

[BibT_eX]

[DOI]

Open J. Math. Optim., 2021

On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On the Recoverable Traveling Salesman Problem.

[BibT_eX]

[DOI]

CoRR, 2021

Recoverable Robust Single Machine Scheduling with Interval Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2021

Automatic generation of algorithms for robust optimisation problems using Grammar-Guided Genetic Programming.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

Multistage robust discrete optimization via quantified integer programming.

[BibT_eX]

[DOI]

Michael Hartisch

Comput. Oper. Res., 2021

A compact reformulation of the two-stage robust resource-constrained project scheduling problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

Combinatorial two-stage minmax regret problems under interval uncertainty.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2021

A Phase I Simplex Method for Finding Feasible Periodic Timetables.

[BibT_eX]

[DOI]

Felix Spühler

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Two-stage combinatorial optimization problems under risk.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Mixed uncertainty sets for robust combinatorial optimization.

[BibT_eX]

[DOI]

Rahul Roy

Optim. Lett., 2020

Generating hard instances for robust combinatorial optimization.

[BibT_eX]

[DOI]

Stephen J. Maher

Eur. J. Oper. Res., 2020

Approximating combinatorial optimization problems with the ordered weighted averaging criterion.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Robust optimization for premarshalling with uncertain priority classes.

[BibT_eX]

[DOI]

Sven Boge

Sigrid Knust

Eur. J. Oper. Res., 2020

Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty.

[BibT_eX]

[DOI]

Michael Poss

Discret. Appl. Math., 2020

Data-Driven Robust Optimization using Unsupervised Deep Learning.

[BibT_eX]

[DOI]

CoRR, 2020

Recoverable Robust Single Machine Scheduling with Budgeted Uncertainty.

[BibT_eX]

[DOI]

CoRR, 2020

Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems.

[BibT_eX]

[DOI]

CoRR, 2020

Particle swarm metaheuristics for robust optimisation with implementation uncertainty.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2020

2019

On the complexity of robust geometric programming with polyhedral uncertainty.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

Representative scenario construction and preprocessing for robust combinatorial optimization problems.

[BibT_eX]

[DOI]

Optim. Lett., 2019

Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Algorithms and uncertainty sets for data-driven robust shortest path problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

The Multi-level Bottleneck Assignment Problem: Complexity and Solution Methods.

[BibT_eX]

[DOI]

CoRR, 2019

Flexible here-and-now decisions for two-stage multi-objective optimization: Method and application to energy system design selection.

[BibT_eX]

[DOI]

Dinah Elena Hollermann

Dörthe Franzisca Hoffrogge

Maike Hennen

André Bardow

CoRR, 2019

Robust two-stage combinatorial optimization problems under convex uncertainty.

[BibT_eX]

[DOI]

CoRR, 2019

A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty.

[BibT_eX]

[DOI]

Michael Wright

Comput. Oper. Res., 2019

Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Robust Network Capacity Expansion with Non-Linear Costs.

[BibT_eX]

[DOI]

Francis Garuba

Peter Jacko

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

On scenario aggregation to approximate robust combinatorial optimization problems.

[BibT_eX]

[DOI]

Optim. Lett., 2018

The quadratic shortest path problem: complexity, approximability, and solution methods.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Ranking robustness and its application to evacuation planning.

[BibT_eX]

[DOI]

Horst W. Hamacher

Anika Kinscherff

Eur. J. Oper. Res., 2018

On recoverable and two-stage robust selection problems with budgeted uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Compromise solutions for robust combinatorial optimization with variable-sized uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Variable-sized uncertainty and inverse problems in robust optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Approximating multiobjective combinatorial optimization problems with the OWA criterion.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Line planning with user-optimal route choice.

[BibT_eX]

[DOI]

Marie Schmidt

Eur. J. Oper. Res., 2017

Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

A biobjective approach to recoverable robustness based on location planning.

[BibT_eX]

[DOI]

Emilio Carrizosa

Eur. J. Oper. Res., 2017

An Improved Algorithm for the Periodic Timetabling Problem.

[BibT_eX]

[DOI]

Christian Liebchen

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Algorithm Engineering in Robust Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

On the recoverable robust traveling salesman problem.

[BibT_eX]

[DOI]

Optim. Lett., 2016

Robust storage loading problems with stacking and payload constraints.

[BibT_eX]

[DOI]

Sigrid Knust

Xuan Thanh Le

Eur. J. Oper. Res., 2016

Robust flows with losses and improvability in evacuation planning.

[BibT_eX]

[DOI]

Ismaila Abderhamane Ndiaye

EURO J. Comput. Optim., 2016

SI: disaster risk management.

[BibT_eX]

[DOI]

Horst W. Hamacher

EURO J. Comput. Optim., 2016

Improvable Knapsack Problems.

[BibT_eX]

[DOI]

CoRR, 2016

On Scenario Aggregation to Approximate Robust Optimization Problems.

[BibT_eX]

[DOI]

CoRR, 2016

A bicriteria approach to robust optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

A combined local search and integer programming approach to the traveling tournament problem.

[BibT_eX]

[DOI]

Stephan Westphal

Ann. Oper. Res., 2016

2015

Exact and heuristic approaches to the robust periodic event scheduling problem.

[BibT_eX]

[DOI]

Public Transp., 2015

Alternative formulations for the ordered weighted averaging objective.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Algorithm Engineering in Robust Optimization.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

CoRR, 2015

The robust knapsack problem with queries.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

The Price of Strict and Light Robustness in Timetable Information.

[BibT_eX]

[DOI]

Transp. Sci., 2014

A robust bus evacuation model with delayed scenario information.

[BibT_eX]

[DOI]

Bob Grün

OR Spectr., 2014

Robust load planning of trains in intermodal transportation.

[BibT_eX]

[DOI]

OR Spectr., 2014

ROPI - a robust optimization programming interface for C++.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2014

Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

A note on upper bounds to the robust knapsack problem with discrete scenarios.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

Approximation Algorithms for the Weight-Reducible Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Solving the Traveling Tournament Problem by Packing Three-Vertex Paths.

[BibT_eX]

[DOI]

Richard Hoshino

Ken-ichi Kawarabayashi

Stephan Westphal

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Evaluating line concepts using travel times and robustness.

[BibT_eX]

[DOI]

Michael Schachtebeck

Public Transp., 2013

An experimental comparison of periodic timetabling models.

[BibT_eX]

[DOI]

Michael Siebert

Comput. Oper. Res., 2013

Improving the modulo simplex algorithm for large-scale periodic timetabling.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Branch and bound algorithms for the bus evacuation problem.

[BibT_eX]

[DOI]

Bob Grün

Philipp Heßler

Comput. Oper. Res., 2013

Recoverable Robust Timetable Information.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Sacha Heße

Marie Schmidt

Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

2011

Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Scenario-Based Approach for Robust Linear Optimization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

The Price of Robustness in Timetable Information.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Martin Knoth

Marie Schmidt

Proceedings of the ATMOS 2011, 2011

2010

An Empirical Analysis of Robustness Concepts for Timetabling.

[BibT_eX]

[DOI]