| Publication | Date of Publication | Type |
|---|
| Wind farm layout optimization under uncertainty | 2024-08-26 | Paper |
| Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model | 2024-01-31 | Paper |
| Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks | 2023-12-18 | Paper |
| Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes | 2023-11-15 | Paper |
| A robust model for the lot-sizing problem with uncertain demands | 2023-07-06 | Paper |
| The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem | 2023-07-04 | Paper |
| Robust inventory theory with perishable products | 2022-07-26 | Paper |
| Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey | 2022-07-22 | Paper |
| The minimum cost network upgrade problem with maximum robustness to multiple node failures | 2022-03-09 | Paper |
| Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries | 2021-11-09 | Paper |
| An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times | 2021-11-05 | Paper |
| Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem | 2021-06-23 | Paper |
| Robust formulations for economic lot-sizing problem with remanufacturing | 2021-06-03 | Paper |
| A computational comparison of compact MILP formulations for the zero forcing number | 2019-10-09 | Paper |
| Mixed integer formulations for a routing problem with information collection in wireless networks | 2019-09-18 | Paper |
| Comparing techniques for modelling uncertainty in a maritime inventory routing problem | 2019-04-30 | Paper |
| An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem | 2018-10-11 | Paper |
| The \(k\)-regular induced subgraph problem | 2018-09-25 | Paper |
| A decomposition approach for the \(p\)-median problem on disconnected graphs | 2018-07-11 | Paper |
| Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph | 2018-05-24 | Paper |
| Valid inequalities for the single arc design problem with set-ups | 2018-05-24 | Paper |
| A hybrid heuristic for a stochastic production-inventory-routing problem | 2018-04-11 | Paper |
| The design of transparent optical networks minimizing the impact of critical nodes | 2018-04-11 | Paper |
| Combined ship routing and inventory management in the salmon farming industry | 2018-02-08 | Paper |
| MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem | 2018-02-01 | Paper |
| A MIP based local search heuristic for a stochastic maritime inventory routing problem | 2017-11-22 | Paper |
| Feasibility check for the distance geometry problem: an application to molecular conformations | 2017-10-02 | Paper |
| Discrete time and continuous time formulations for a short sea inventory routing problem | 2017-06-21 | Paper |
| The robust vehicle routing problem with time windows | 2016-11-14 | Paper |
| A maritime inventory routing problem with stochastic sailing and port times | 2016-11-10 | Paper |
| Lifted Euclidean inequalities for the integer single node flow set with upper bounds | 2016-10-07 | Paper |
| A dynamic programming approach for a class of robust optimization problems | 2016-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3178032 | 2016-07-08 | Paper |
| A maritime inventory routing problem: discrete time formulations and valid inequalities | 2016-06-10 | Paper |
| Implicit cover inequalities | 2016-04-13 | Paper |
| Hybrid heuristics for a short sea inventory routing problem | 2015-02-03 | Paper |
| Facets for the single node fixed-charge network set with a node set-up variable | 2014-04-30 | Paper |
| Using decomposition to improve greedy solutions of the optimal diversity management problem | 2013-11-14 | Paper |
| A new branch and bound method for a discrete truss topology design problem | 2013-02-25 | Paper |
| Layered Formulation for the Robust Vehicle Routing Problem with Time Windows | 2012-11-02 | Paper |
| Mixing polyhedra with two non divisible coefficients | 2012-10-15 | Paper |
| On the Weight-Constrained Minimum Spanning Tree Problem | 2011-09-09 | Paper |
| A compact formulation of a mixed-integer set | 2010-09-21 | Paper |
| The linking set problem: a polynomial special case of the multiple-choice knapsack problem | 2010-01-19 | Paper |
| Extended formulations for the cardinality constrained subtree of a tree problem | 2009-08-14 | Paper |
| Lifting two-integer knapsack inequalities | 2007-03-05 | Paper |
| Description of 2-integer continuous knapsack polyhedra | 2006-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477436 | 2006-07-03 | Paper |
| Polyhedral description of the integer single node flow set with constant bounds | 2006-01-13 | Paper |
| Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs | 2001-12-05 | Paper |
