| Publication | Date of Publication | Type |
|---|
| Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems | 2024-03-12 | Paper |
| Solving vehicle routing problems with intermediate stops using VRPSolver models | 2023-12-18 | Paper |
| A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem | 2023-03-06 | Paper |
| A unified exact approach for clustered and generalized vehicle routing problems | 2022-12-19 | Paper |
| The multiple Steiner TSP with order constraints: complexity and optimization algorithms | 2022-07-21 | Paper |
| Cover by disjoint cliques cuts for the knapsack problem with conflicting items | 2022-03-11 | Paper |
| A POPMUSIC matheuristic for the capacitated vehicle routing problem | 2022-03-09 | Paper |
| Solving bin packing problems using VRPSolver models | 2021-06-17 | Paper |
| A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection | 2021-04-20 | Paper |
| On the multiple Steiner traveling salesman problem with order constraints | 2021-02-04 | Paper |
| Primal Heuristics for Branch and Price: The Assets of Diving Methods | 2020-12-03 | Paper |
| Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation | 2020-11-09 | Paper |
| On the exact solution of a large class of parallel machine scheduling problems | 2020-08-31 | Paper |
| A generic exact solver for vehicle routing and related problems | 2020-08-28 | Paper |
| On the exact solution of vehicle routing problems with backhauls | 2020-06-17 | Paper |
| Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut | 2020-02-24 | Paper |
| A generic exact solver for Vehicle Routing and related problems | 2020-02-06 | Paper |
| Fast Local Search for Steiner Trees in Graphs | 2019-09-11 | Paper |
| Distance Transformation for Network Design Problems | 2019-08-27 | Paper |
| On the complete set packing and set partitioning polytopes: properties and rank 1 facets | 2019-06-11 | Paper |
| Limited memory rank-1 cuts for vehicle routing problems | 2019-02-22 | Paper |
| Improved state space relaxation for constrained two-dimensional guillotine cutting problems | 2018-10-30 | Paper |
| Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems | 2018-07-12 | Paper |
| A branch-and-price algorithm for the minimum latency problem | 2018-07-11 | Paper |
| A robust and scalable algorithm for the Steiner problem in graphs | 2018-06-25 | Paper |
| New benchmark instances for the capacitated vehicle routing problem | 2018-05-24 | Paper |
| New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows | 2017-12-29 | Paper |
| Improved branch-cut-and-price for capacitated vehicle routing | 2017-08-15 | Paper |
| Unsplittable non-additive capacitated network design using set functions polyhedra | 2016-11-17 | Paper |
| A hybrid algorithm for a class of vehicle routing problems | 2016-11-10 | Paper |
| Column generation approaches for the software clustering problem | 2016-07-01 | Paper |
| Exact algorithms for the traveling salesman problem with draft limits | 2015-02-19 | Paper |
| Formulations for a problem of petroleum transportation | 2015-02-04 | Paper |
| Improved Branch-Cut-and-Price for Capacitated Vehicle Routing | 2014-06-02 | Paper |
| Fast local search for the steiner problem in graphs | 2014-04-01 | Paper |
| Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery | 2013-11-01 | Paper |
| Hop‐level flow formulation for the survivable network design with hop constraints problem | 2013-08-06 | Paper |
| The time dependent traveling salesman problem: polyhedra and algorithm | 2013-04-12 | Paper |
| A hybrid algorithm for the heterogeneous fleet vehicle routing problem | 2012-12-29 | Paper |
| Strong bounds with cut and column generation for class-teacher timetabling | 2012-11-15 | Paper |
| The Team Orienteering Problem: Formulations and Branch-Cut and Price | 2012-09-28 | Paper |
| Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem | 2012-06-18 | Paper |
| A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs | 2012-05-30 | Paper |
| Solving Replica Placement and Request Distribution in Content Distribution Networks | 2012-05-13 | Paper |
| Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery | 2012-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109941 | 2012-01-26 | Paper |
| Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem | 2011-09-09 | Paper |
| Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs | 2011-06-17 | Paper |
| Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems | 2011-01-28 | Paper |
| A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem | 2010-11-24 | Paper |
| Improved lower bounds for the split delivery vehicle routing problem | 2010-09-07 | Paper |
| Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems | 2010-06-02 | Paper |
| A facility location and installation of resources model for level of repair analysis | 2009-04-08 | Paper |
| Reduction tests for the prize-collecting Steiner problem | 2008-01-15 | Paper |
| Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation | 2008-01-07 | Paper |
| A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem | 2008-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439711 | 2007-05-29 | Paper |
| Robust branch-and-cut-and-price for the capacitated vehicle routing problem | 2006-06-14 | Paper |
| Solving capacitated arc routing problems using a transformation to the CVRP | 2006-01-10 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut | 2002-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741494 | 2001-10-24 | Paper |
| The \(\gamma\)-connected assignment problem | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263730 | 1999-09-22 | Paper |
