A computational study on Integer Programming formulations for Hop-constrained survivable network design

Abstract

We consider a Network Design problem where edges have to be activated at minimum cost while ensuring that the resulting graph contains at least $k$ disjoint paths linking a given set of origin–destination pairs. In addition, those paths are constrained in terms of maximum number of intermediate nodes. We consider alternative Integer Programming formulations for the problem and computationally evaluate them on a large benchmark of instances having different features. Finally, we extend our analysis to the case in which the paths must be vertex disjoint.