Hop Constrained Network Design Problem with Partial Survivability

Samit Soni ()

Annals of Operations Research, 2001, vol. 106, issue 1, 198 pages

Abstract: This paper studies the hop constrained network design problem with partial survivability, namely, given an undirected network, a set of point-to-point demands (commodities), and transmission link costs, identify two node disjoint paths for each demand (commodity) to minimize the total costs subject to the constraints that each demand is routed and traverses at most a specified number of links (or hops) on both the paths. A mathematical programming formulation of the problem is presented and an efficient solution procedure based on the linear programming relaxation is developed. Extensive computational results across a number of networks are reported. These results indicate that the solution procedure is effective for a wide range of problem sizes. Copyright Kluwer Academic Publishers 2001

Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1014513809519 (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:106:y:2001:i:1:p:181-198:10.1023/a:1014513809519

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

DOI: 10.1023/A:1014513809519

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 ().