Quentin Botton

On the hop-constrained survivable network design problem with reliable edges

  • Quentin Botton
  • Bernard Fortz
  • Luís Gouveia
    • Categories Branch and Cut Algorithms, Cutting Plane Approaches, Network Optimization Tags , , , ,

    In this paper, we study the hop-constrained survivable network design problem with reliable edges. Given a graph with non-negative edge weights and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L … Read more

    Benders decomposition for the hop-constrainted survivable network design problem

  • Quentin Botton
  • Bernard Fortz
  • Luís Gouveia
  • Michael Poss
    • Categories Branch and Cut Algorithms, Telecommunications

    Given a graph with nonnegative edge weights and a set of pairs of nodes 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 Gouveia, … Read more