Name
Abstract | ||
|---|---|---|
This paper presents a constraint generation approach to the network reliability problem of adding spare capacity at minimum cost that allows the traffic on a failed link to be rerouted to its destination. Any number of non-simultaneous link failures can be part of the requirements on the spare capacity. The key result is a necessary and sufficient condition for a multicommodity flow to exist, which is derived in the appendix. Computational results on large numbers of random networks are presented. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1023/A:1014561725448 | Annals OR |
Keywords | Field | DocType |
network reliability,networks/graphs,multicommodity flows,mathematical programming | Mathematical optimization,Constraint generation,Spare part,Reliability (computer networking),Multi-commodity flow problem,Mathematics | Journal |
Volume | Issue | ISSN |
106 | 1-4 | 1572-9338 |
Citations | PageRank | References |
3 | 0.48 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jack Shaio | 1 | 6 | 0.94 |