Ouveysi, I.Wirth, A.Yeh, A.Oǧuz, O.2016-02-082016-02-0820030254-5330http://hdl.handle.net/11693/24409We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.EnglishLink failureSurvivableLarge scale linear programs and heuristics for the design of survivable telecommunication networksArticle10.1023/B:ANOR.0000004774.11601.b61572-9338