Exact algorithms for bi-objective ring tree problems with reliability measures

We introduce bi-objective models for ring tree network design with a focus on network reliability within telecommunication applications. Our approaches generalize the capacitated ring tree problem (CRTP) which asks for a partially reliable topology that connects customers with different security requirements to a depot node by combined ring and tree graphs. While the CRTP aims … Read more

Reliable p-median facility location problem: two-stage robust models and algorithms

In this paper, we propose a set of two-stage robust optimization models to design reliable p-median facility location networks subject to disruptions. A customized column-and- constraint generation approach is implemented and shown to be more effective than Benders cutting plane method. Numerical experiments are performed on real data and management insights on system design are … Read more

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

We study solution approaches for the design of reliably connected networks. Speci fically, 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 satis ed is at least 1-\epsilon, where \epsilon is a risk tolerance. We consider two … Read more