| Publication | Date of Publication | Type |
|---|
| Formulations and valid inequalities for the capacitated dispersion problem | 2023-12-18 | Paper |
| A joint demand and supply management approach to large scale urban evacuation planning: evacuate or shelter-in-place, staging and dynamic resource allocation | 2023-11-15 | Paper |
| Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty | 2023-08-09 | Paper |
| Cargo securing under multi-drop and axle weight constraints | 2023-07-03 | Paper |
| Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty | 2022-12-19 | Paper |
| The TSP with drones: The benefits of retraversing the arcs | 2022-07-07 | Paper |
| A Branch-and-Bound Algorithm for Team Formation on Social Networks | 2022-06-27 | Paper |
| An exact solution approach for the inventory routing problem with time windows | 2022-03-09 | Paper |
| Convex hull results for generalizations of the constant capacity single node flow set | 2021-04-23 | Paper |
| Exact algorithms for budgeted prize-collecting covering subgraph problems | 2021-01-10 | Paper |
| Multi-stage stochastic programming for demand response optimization | 2020-06-04 | Paper |
| A stochastic programming approach for Shelter location and evacuation planning | 2019-01-18 | Paper |
| Convex hull results for the warehouse problem | 2019-01-14 | Paper |
| The periodic vehicle routing problem with driver consistency | 2018-11-19 | Paper |
| A capacitated hub location problem under hose demand uncertainty | 2018-07-12 | Paper |
| Branch-and-price approaches for the network design problem with relays | 2018-07-12 | Paper |
| Stochastic lot sizing problem with nervousness considerations | 2018-07-11 | Paper |
| The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm | 2018-05-23 | Paper |
| New exact solution approaches for the split delivery vehicle routing problem | 2018-04-12 | Paper |
| Survivability in Hierarchical Telecommunications Networks Under Dual Homing | 2017-03-01 | Paper |
| A branch-and-cut algorithm for two-level survivable network design problems | 2016-11-17 | Paper |
| Time constrained maximal covering salesman problem with weighted demands and partial coverage | 2016-11-17 | Paper |
| A branch-and-cut algorithm for the hub location and routing problem | 2016-11-10 | Paper |
| Hierarchical survivable network design problems | 2016-10-18 | Paper |
| Continuous knapsack sets with divisible capacities | 2016-04-04 | Paper |
| Lot Sizing with Piecewise Concave Production Costs | 2015-01-26 | Paper |
| Relaxations for two-level multi-item lot-sizing problems | 2014-08-29 | Paper |
| The splittable flow arc set with capacity and minimum load constraints | 2014-05-15 | Paper |
| An intermodal multicommodity routing problem with scheduled services | 2012-12-12 | Paper |
| A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands | 2012-12-07 | Paper |
| Release Time Scheduling and Hub Location for Next-Day Delivery | 2012-12-07 | Paper |
| Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths | 2012-11-15 | Paper |
| The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations | 2012-07-28 | Paper |
| Survivability in hierarchical telecommunications networks | 2012-06-18 | Paper |
| Allocation strategies in hub networks | 2012-05-14 | Paper |
| A multi-stage stochastic programming approach in master production scheduling | 2012-05-14 | Paper |
| The vendor location problem | 2011-06-30 | Paper |
| Erratum to: ``Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution | 2011-06-28 | Paper |
| A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem | 2011-05-09 | Paper |
| Health network mergers and hospital re-planning | 2010-10-14 | Paper |
| Generating Facets for the Independence System Polytope | 2010-08-27 | Paper |
| Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution | 2010-04-28 | Paper |
| Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships | 2008-12-17 | Paper |
| The Integer Knapsack Cover Polyhedron | 2008-08-13 | Paper |
| Star \(p\)-hub median problem with modular arc capacities | 2008-03-11 | Paper |
| Solving the hub location problem in a star–star network | 2008-01-08 | Paper |
| Manufacturer's mixed pallet design problem | 2007-11-23 | Paper |
| Restricted robust uniform matroid maximization under interval uncertainty | 2007-05-10 | Paper |
| Polyhedral analysis for concentrator location problems | 2006-11-17 | Paper |
| Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities | 2006-06-01 | Paper |
| Formulations and valid inequalities for the heterogeneous vehicle routing problem | 2006-05-02 | Paper |
| Solving the hub location problem with modular link capacities | 2005-09-02 | Paper |
| A branch and cut algorithm for hub location problems with single assignment | 2005-04-19 | Paper |
| Concentrator location in telecommunications networks. | 2005-02-10 | Paper |
| Projecting the flow variables for hub location problems | 2005-01-12 | Paper |
| Concentrator location in telecommunications | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3147665 | 2002-01-01 | Paper |
| The robust spanning tree problem with interval data | 2001-12-05 | Paper |
| On the connected (sub)partition polytope | N/A | Paper |
