title: Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems.
abstract: In this article, we introduce the Generalized [Formula: see text]-Survivable Network Design Problem ([Formula: see text]-GSNDP) which has applications in the design of backbone networks. Different mixed integer linear programming formulations are derived by combining previous results obtained for the related [Formula: see text]-GSNDP and Generalized Network Design Problems. An extensive computational study comparing the correspondingly developed branch-and-cut approaches shows clear advantages for two particular variants. Additional insights into individual advantages and disadvantages of the developed algorithms for different instance characteristics are given.
authors: Department of Statistics and Operations Research, Faculty of Business, Economics and Statistics, University of Vienna, Vienna, Austria.
authors: Markus
authors: 0000-0002-3313-9610
authors: M
authors: Leitner
keywords:  Branch-and-cut; Biconnectivity; Generalized network design; Mixed integer linear programming; Survivability