Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks

Iradj Ouveysi (), Andrew Wirth, Annie Yeh and Osman Oğuz

Annals of Operations Research, 2003, vol. 124, issue 1, 285-293

Abstract: We 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. Copyright Kluwer Academic Publishers 2003

Keywords: survivable; link failure (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/B:ANOR.0000004774.11601.b6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:124:y:2003:i:1:p:285-293:10.1023/b:anor.0000004774.11601.b6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/B:ANOR.0000004774.11601.b6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().