In this article, we introduce the Generalized \(\{0,1,2\}\)-Survivable Network Design Problem (\(\{0,1,2\}\)-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 \(\{0,1,2\}\)-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.

中文翻译：

---

整数编程模型和分支剪切方法，用于解决广义的{0,1,2}-可生存的网络设计问题。

在本文中，我们介绍了广义\（\ {0,1,2 \} \）-可生存网络设计问题（\（\ {0,1,2 \} \）- GSNDP），该问题在以下方面的设计中具有应用骨干网。通过将有关\（\ {0,1,2 \} \）- GSNDP和广义网络设计问题获得的先前结果进行组合，可以得出不同的混合整数线性规划公式。大量的计算研究比较了相应开发的分支剪切方法，显示了两种特定变体的明显优势。给出了针对不同实例特征的已开发算法的个体优缺点的其他见解。