## Branch-and-cut Approaches for Chance-constrained Formulations of Reliable Network Design Problems

We study solution approaches for the design of reliably connected networks. Specifically, given a network with arcs that may fail at random, the goal is to select a minimum cost subset of arcs such the probability that a connectivity requirement is satised is at least 1-\epsilon, where \epsilon is a risk tolerance. We consider two … Read more