Bounds on expected performance of networks with links subject to failure
DOI10.1002/NET.3230140307zbMATH Open0545.90048OpenAlexW2077378979WikidataQ126263615 ScholiaQ126263615MaRDI QIDQ3337192FDOQ3337192
Authors: Malachy Carey, Chris Hendrickson
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140307
Recommendations
large networksUpper and lower boundsrandom failurecapacitated networks with linksexpected maximum flows
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)
Cited In (12)
- The \(\alpha\)-maximum flow model with uncertain capacities
- The impact of dynamic events on the number of errors in networks
- On Onaga's upper bound on the mean values of probabilistic maximum flows
- Availability Formulas and Performance Measures for Separable Degradable Networks
- Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
- Robustness of square networks
- The value of information in stochastic maximum flow problems
- Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
- Assessing the reliability and the expected performance of a network under disaster risk
- Lower bounds on two-terminal network reliability
- Renewal Networks: Connectivity and Reachability on a Time Interval
- Network reliability: Heading out on the highway
This page was built for publication: Bounds on expected performance of networks with links subject to failure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337192)