BOTTON, Quentin; FORTZ, Bernard; GOUVEIA, Luis; POSS, … - Center for Operations Research and Econometrics (CORE), … - 2011
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by...