| Publication | Date of Publication | Type |
|---|
VRPSolverEasy: a Python library for the exact solution of a rich vehicle routing problem
INFORMS Journal on Computing | 2024-09-05 | Paper |
A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
Computers & Operations Research | 2024-06-06 | Paper |
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems
Operations Research | 2024-03-12 | Paper |
Solving vehicle routing problems with intermediate stops using VRPSolver models
Networks | 2023-12-18 | Paper |
A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
4OR | 2023-03-06 | Paper |
A unified exact approach for clustered and generalized vehicle routing problems
Computers & Operations Research | 2022-12-19 | Paper |
The multiple Steiner TSP with order constraints: complexity and optimization algorithms
Soft Computing | 2022-07-21 | Paper |
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Operations Research Letters | 2022-03-11 | Paper |
A POPMUSIC matheuristic for the capacitated vehicle routing problem
Computers & Operations Research | 2022-03-09 | Paper |
Solving bin packing problems using VRPSolver models
SN Operations Research Forum | 2021-06-17 | Paper |
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Computers & Operations Research | 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
INFORMS Journal on Computing | 2020-12-03 | Paper |
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
INFORMS Journal on Computing | 2020-11-09 | Paper |
On the exact solution of a large class of parallel machine scheduling problems
Journal of Scheduling | 2020-08-31 | Paper |
A generic exact solver for vehicle routing and related problems
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
On the exact solution of vehicle routing problems with backhauls
European Journal of Operational Research | 2020-06-17 | Paper |
Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Discrete Optimization | 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
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Distance transformation for network design problems
SIAM Journal on Optimization | 2019-08-27 | Paper |
On the complete set packing and set partitioning polytopes: properties and rank 1 facets
Operations Research Letters | 2019-06-11 | Paper |
Limited memory rank-1 cuts for vehicle routing problems
Operations Research Letters | 2019-02-22 | Paper |
Improved state space relaxation for constrained two-dimensional guillotine cutting problems
European Journal of Operational Research | 2018-10-30 | Paper |
Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
European Journal of Operational Research | 2018-07-12 | Paper |
A branch-and-price algorithm for the minimum latency problem
Computers & Operations Research | 2018-07-11 | Paper |
A robust and scalable algorithm for the Steiner problem in graphs
Mathematical Programming Computation | 2018-06-25 | Paper |
New benchmark instances for the capacitated vehicle routing problem
European Journal of Operational Research | 2018-05-24 | Paper |
New enhancements for the exact solution of the vehicle routing problem with time windows
INFORMS Journal on Computing | 2017-12-29 | Paper |
Improved branch-cut-and-price for capacitated vehicle routing
Mathematical Programming Computation | 2017-08-15 | Paper |
Unsplittable non-additive capacitated network design using set functions polyhedra
Computers & Operations Research | 2016-11-17 | Paper |
A hybrid algorithm for a class of vehicle routing problems
Computers & Operations Research | 2016-11-10 | Paper |
Column generation approaches for the software clustering problem
Computational Optimization and Applications | 2016-07-01 | Paper |
Exact algorithms for the traveling salesman problem with draft limits
European Journal of Operational Research | 2015-02-19 | Paper |
Formulations for a problem of petroleum transportation
European Journal of Operational Research | 2015-02-04 | Paper |
Improved branch-cut-and-price for capacitated vehicle routing
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Fast local search for the Steiner problem in graphs
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
Optimization Letters | 2013-11-01 | Paper |
Hop-level flow formulation for the survivable network design with hop constraints problem
Networks | 2013-08-06 | Paper |
The time dependent traveling salesman problem: polyhedra and algorithm
Mathematical Programming Computation | 2013-04-12 | Paper |
A hybrid algorithm for the heterogeneous fleet vehicle routing problem
European Journal of Operational Research | 2012-12-29 | Paper |
Strong bounds with cut and column generation for class-teacher timetabling
Annals of Operations Research | 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
Networks | 2012-06-18 | Paper |
A hybrid GRASP with perturbations for the Steiner problem in graphs
INFORMS Journal on Computing | 2012-05-30 | Paper |
Solving replica placement and request distribution in content distribution networks
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Operations Research Letters | 2012-04-05 | Paper |
| Cuts over extended formulations by flow discretization | 2012-01-26 | Paper |
Hop-level flow formulation for the hop constrained survivable network design problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
Mathematical Programming Computation | 2011-01-28 | Paper |
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
Networks | 2010-11-24 | Paper |
Improved lower bounds for the split delivery vehicle routing problem
Operations Research Letters | 2010-09-07 | Paper |
Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
A facility location and installation of resources model for level of repair analysis
European Journal of Operational Research | 2009-04-08 | Paper |
Reduction tests for the prize-collecting Steiner problem
Operations Research Letters | 2008-01-15 | Paper |
Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
Mathematical Programming. Series A. Series B | 2008-01-07 | Paper |
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
Experimental Algorithms | 2008-01-02 | Paper |
| scientific article; zbMATH DE number 5158528 (Why is no real title available?) | 2007-05-29 | Paper |
Robust branch-and-cut-and-price for the capacitated vehicle routing problem
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
Solving capacitated arc routing problems using a transformation to the CVRP
Computers & Operations Research | 2006-01-10 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut
Mathematical Programming. Series A. Series B | 2002-08-19 | Paper |
| Dual heuristics on the exact solution of large Steiner problems | 2001-10-24 | Paper |
The \(\gamma\)-connected assignment problem
European Journal of Operational Research | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1342148 (Why is no real title available?) | 1999-09-22 | Paper |
