Related references
Note: Only part of the references are listed.Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Guy Desaulniers
OPERATIONS RESEARCH (2010)
A column generation approach for the split delivery vehicle routing problem
Mingzhou Jin et al.
OPERATIONS RESEARCH LETTERS (2008)
An optimization-based heuristic for the split delivery vehicle routing problem
Claudia Archetti et al.
TRANSPORTATION SCIENCE (2008)
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
Si Chen et al.
NETWORKS (2007)
A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem
Mingzhou Jin et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2007)
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
Giovanni Righini et al.
DISCRETE OPTIMIZATION (2006)
A shortest path approach to the multiple-vehicle routing problem with split pick-ups
CG Lee et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2006)
Worst-case analysis for split delivery vehicle routing problems
C Archetti et al.
TRANSPORTATION SCIENCE (2006)
A tabu search algorithm for the split delivery vehicle routing problem
C Archetti et al.
TRANSPORTATION SCIENCE (2006)
On the capacitated vehicle routing problem
TK Ralphs et al.
MATHEMATICAL PROGRAMMING (2003)
A lower bound for the split delivery vehicle routing problem
JM Belenguer et al.
OPERATIONS RESEARCH (2000)
On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm
F Vanderbeck
OPERATIONS RESEARCH (2000)
Share Paper
