In this paper we focus on the single-facility capacitated survivable network design problem. We optimize simultaneously the network topology and the link dimensioning in order to route all traffic commodities according to survivability requirements. The latter are actually expressed in terms of the spare capacity required to address link failures in the context of different rerouting strategies. We present a mixed-integer linear programming model solved by combining several approaches. To tackle the high dimensionality and to separate the continuous and integer variables, we use Benders' decomposition and a cutting-plane approach. Going beyond the proposed method itself, we examine and compare two well-known restoration techniques: local and end-to-end reroutings. Numerous computational results for realistic network instances provide a comparison of these rerouting mechanisms in terms of installed capacities, network density as well as overall costs and CPU time.

In this paper we focus on the single facility capacitated survivable network design problem. We optimize simultaneously the topology, the link dimensioning for the nominal state as well as for the single link failure state when the survivable conditions are expressed by various rerouting strategies. We present an (mixed) integer mathematical approach that consists of several methodologies. To address the high dimensionality we use Benders' decomposition, and in parallel a Branch-and-Bound method and a cutting plane approach. Beyond the interest of the proposed approach itself, we have considered and compared two well known restoration technics as local rerouting and end-toend rerouting. Numerous computational results for realistic instance networks are given to compare these rerouting mechanisms in terms of installed capacities as well as overall costs with respect to topology requirements.