| Article ID: | iaor20042836 |
| Country: | Netherlands |
| Volume: | 124 |
| Issue: | 1 |
| Start Page Number: | 285 |
| End Page Number: | 293 |
| Publication Date: | Nov 2003 |
| Journal: | Annals of Operations Research |
| Authors: | Wirth Andrew, Ouveysi Iradj, Yeh Annie |
| Keywords: | heuristics |
We consider the problem of providing a minimum cost multi-service network subject to one link failures 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.