Design of Survivable Networks with Bounded-Length Paths

Explore the design of survivable networks with bounded-length paths in this 52-minute seminar from GERAD Research Center. Delve into the k-edge-disjoint L-hop-connected paths problem, which aims to find a minimum cost subgraph with at least k edge-disjoint paths of length at most L between terminal pairs. Examine integer programming formulations, valid inequalities, and separation routines for this problem, which has applications in telecommunication network design. Learn about a Branch-and-Cut algorithm for specific cases where L=2,3 and k=2. Discover the integrality of the linear relaxation of the associated polytope when L=3, k≥2, and |K|=1, leading to a polynomial time cutting plane algorithm for this scenario.