The elementary shortest path with resource constraints are commonly solved with dynamic programming algorithms. We present a branch-and-cut algorithm for the undirected version. Two types of resources are discussed: A capacity and a fixed charge resource. The former is the subproblem of the capacitated vehicle routing problem and the latter is for the split delivery version.
|Publication status||Published - 2010|
|Event||Optimization Days 2010 - Montréal, Canada|
Duration: 10 May 2010 → 12 May 2010
|Conference||Optimization Days 2010|
|Period||10/05/2010 → 12/05/2010|