An Algorithm for Network Reliability Bounds
From MaRDI portal
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(17)- A decomposition algorithm for network reliability evaluation
- A new method for the performance index of a communication network
- A novel algorithm on network reliability estimation
- A BDD-based method for computing network reliability
- scientific article; zbMATH DE number 4145632 (Why is no real title available?)
- Algebraic Methods Applied to Network Reliability Problems
- scientific article; zbMATH DE number 4027153 (Why is no real title available?)
- A piecewise linear upper bound on the network recourse function
- Improving reliability bounds in computer networks
- Adaptive statistical algorithms in network reliability analysis
- Consecutive cuts and paths, and bounds on k‐terminal reliability
- scientific article; zbMATH DE number 919112 (Why is no real title available?)
- scientific article; zbMATH DE number 7375995 (Why is no real title available?)
- An improved algorithm for reliability bounds of multistate networks
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
- On The Expansion Problem of Reliable ip Networks with Performance Guarantees
- A modified algorithm for computing the upper-bound reliabilty of computer networks
This page was built for publication: An Algorithm for Network Reliability Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025911)