| Publication | Date of Publication | Type |
|---|
Perfect matching under precedence constraints
Networks | 2026-03-05 | Paper |
| Interval-constrained bipartite matching over time | 2026-02-10 | Paper |
Precedence-constrained shortest path
Networks | 2025-12-05 | Paper |
Minimum-peak-cost flows over time
Networks | 2025-12-04 | Paper |
| Analysing the complexity of facility location problems with capacities, revenues, and closest assignments | 2025-10-31 | Paper |
| On the complexity of robust transshipment under consistent flow constraints | 2025-10-31 | Paper |
| Coworking scheduling with network flows | 2025-10-31 | Paper |
Cover-based inequalities for the single-source capacitated facility location problem with customer preferences
Computers & Operations Research | 2025-09-10 | Paper |
Patient-to-room assignment with single-rooms entitlements: combinatorial insights and integer programming formulations
European Journal of Operational Research | 2025-05-20 | Paper |
Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
Discrete Applied Mathematics | 2024-09-26 | Paper |
Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations
Networks | 2024-05-03 | Paper |
The complexity of the timetable‐based railway network design problem
Networks | 2024-03-15 | Paper |
Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
Discrete Applied Mathematics | 2024-02-27 | Paper |
Structural insights about avoiding transfers in the patient-to-room assignment problem
Discrete Applied Mathematics | 2024-02-27 | Paper |
Robust transshipment problem under consistent flow constraints
Networks | 2024-01-18 | Paper |
Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings
Networks | 2023-12-11 | Paper |
Recycling inequalities for robust combinatorial optimization with budget uncertainty
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
One transfer per patient suffices: structural insights about patient-to-room assignment
Lecture Notes in Computer Science | 2023-08-03 | Paper |
A branch and bound algorithm for robust binary optimization with budget uncertainty
Mathematical Programming Computation | 2023-07-24 | Paper |
Robust minimum cost flow problem under consistent flow constraints
Annals of Operations Research | 2022-06-13 | Paper |
Robust strategic planning for mobile medical units with steerable and unsteerable demands
European Journal of Operational Research | 2021-11-05 | Paper |
| The Dial-a-Ride Problem in Primary Care with Flexible Scheduling | 2021-05-30 | Paper |
Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
EURO Journal on Computational Optimization | 2019-10-18 | Paper |
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation
EURO Journal on Computational Optimization | 2019-03-14 | Paper |
Multi-budgeted matching problems
Networks | 2018-10-11 | Paper |
The budgeted minimum cost flow problem with unit upgrading cost
Networks | 2018-06-13 | Paper |
Reference points and approximation algorithms in multicriteria discrete optimization
European Journal of Operational Research | 2018-05-29 | Paper |
Robust and sustainable supply chains under market uncertainties and different risk attitudes -- a case study of the German biodiesel market
European Journal of Operational Research | 2018-04-23 | Paper |
| Budgeted colored matching problems | 2018-04-11 | Paper |
Improved handling of uncertainty and robustness in set covering problems
European Journal of Operational Research | 2018-02-06 | Paper |
| The capacitated budgeted minimum cost flow problem with unit upgrading costs | 2017-02-14 | Paper |
A new theoretical framework for robust optimization under multi-band uncertainty
Operations Research Proceedings | 2015-02-12 | Paper |
Recoverable robust knapsacks: the discrete scenario case
Optimization Letters | 2012-11-30 | Paper |
Recoverable robust shortest path problems
Networks | 2012-06-18 | Paper |
Recoverable robust knapsacks: \(\Gamma \)-scenarios
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Line planning, path constrained network flow and inapproximability
Networks | 2011-02-17 | Paper |
Robust algorithms for sorting railway cars
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Graph optimization and network optimization
Graphen- und Netzwerkoptimierung | 2010-03-12 | Paper |
The Exact Subgraph Recoverable Robust Shortest Path Problem
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
(available as arXiv preprint) | N/A | Paper |
