| Publication | Date of Publication | Type |
|---|
| Robustness of solutions to the capacitated facility location problem with uncertain demand | 2022-11-01 | Paper |
| A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques | 2022-06-27 | Paper |
| A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs | 2022-01-10 | Paper |
| The Schrijver system of the flow cone in series-parallel graphs | 2022-01-05 | Paper |
| A constraints-aware reweighted feasibility pump approach | 2021-12-13 | Paper |
| A branch-and-price algorithm for the minimum sum coloring problem | 2021-09-15 | Paper |
| Efficient formulations for the traveling car renter problem and its quota variant | 2021-08-19 | Paper |
| A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem | 2021-06-03 | Paper |
| An exact algorithm for robust influence maximization | 2020-08-28 | Paper |
| An exact algorithm for robust influence maximization | 2020-02-06 | Paper |
| A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints | 2019-11-28 | Paper |
| Shared mobility systems: an updated survey | 2019-03-06 | Paper |
| A new effective unified model for solving the pre-marshalling and block relocation problems | 2018-07-25 | Paper |
| Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks | 2018-05-24 | Paper |
| Optimal Solution of Vehicle Routing Problems with Fractional Objective Function | 2018-04-09 | Paper |
| A branch\&price\&cut algorithm for the vehicle routing problem with intermediate replenishment facilities | 2017-02-14 | Paper |
| A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks | 2016-11-30 | Paper |
| Fast machine reassignment | 2016-11-07 | Paper |
| Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks | 2016-10-24 | Paper |
| An exact algorithm for the static rebalancing problem arising in bicycle sharing systems | 2016-10-06 | Paper |
| The static bicycle relocation problem with demand intervals | 2016-06-23 | Paper |
| An analytical approach to calculate the capacity of a railway system | 2016-03-15 | Paper |
| Shared mobility systems | 2016-01-13 | Paper |
| Bike sharing systems: solving the static rebalancing problem | 2014-04-15 | Paper |
| Solving the electricity production planning problem by a column generation based heuristic | 2014-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867374 | 2013-12-11 | Paper |
| An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem | 2013-07-02 | Paper |
| The team orienteering problem with time windows: an LP-based granular variable neighborhood search | 2012-12-29 | Paper |
| UniALT for regular language contrained shortest paths on a multi-modal transportation network | 2012-09-28 | Paper |
| Hybridized evolutionary local search algorithm for the team orienteering problem with time windows | 2012-05-08 | Paper |
| An Exact Method for the Capacitated Location-Routing Problem | 2012-03-26 | Paper |
| A Matheuristic for the Dial-a-Ride Problem | 2011-09-09 | Paper |
| Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem | 2011-04-01 | Paper |
| A Branch-and-Cut method for the Capacitated Location-Routing Problem | 2011-01-31 | Paper |
| An effective memetic algorithm for the cumulative capacitated vehicle routing problem | 2010-06-11 | Paper |
| Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem | 2010-03-23 | Paper |
| On the Complexity of the Multiple Stack TSP, kSTSP | 2009-06-03 | Paper |
| A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem | 2007-11-06 | Paper |
| An effective and fast heuristic for the dial-a-ride problem | 2007-08-31 | Paper |
| Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking | 2007-01-24 | Paper |
| A metaheuristic to solve a location-routing problem with nonlinear costs | 2006-05-29 | Paper |
| A distributed geographic information system for the daily car pooling problem | 2004-11-12 | Paper |
| A heuristic approach to the overnight security service problem | 2003-04-28 | Paper |
| A New Heuristic for the Traveling Salesman Problem with Time Windows | 2002-10-17 | Paper |
| A heuristic for the vehicle routing problem with time windows | 2001-01-01 | Paper |
