A dynamic bounding algorithm for approximating multi-state two-terminal reliability
From MaRDI portal
Publication:976369
DOI10.1016/J.EJOR.2010.01.033zbMATH Open1189.90049OpenAlexW2001854852MaRDI QIDQ976369FDOQ976369
Authors: Chin-Chia Jane, Yih-Wenn Laih 
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.033
Recommendations
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- Practical sequential bounds for approximating two-terminal reliability
- An improved algorithm for reliability bounds of multistate networks
- First-and second-order bounds on terminal reliability
- scientific article; zbMATH DE number 176263
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)
Cites Work
- Title not available (Why is that?)
- Computational investigations of maximum flow algorithms
- Practical sequential bounds for approximating two-terminal reliability
- Reliability Bounds for Multistate Systems with Multistate Components
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- Title not available (Why is that?)
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- Reliability Evaluation of Multistate Systems with Multistate Components
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Computing Network Reliability
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
- Title not available (Why is that?)
- A simple algorithm to search for all MCs in networks
Cited In (8)
- Fast computation of bounds for two-terminal network reliability
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- An improved algorithm for reliability bounds of multistate networks
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- Reliability and covariance estimation of weighted \(k\)-out-of-\(n\) multi-state systems
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- Practical sequential bounds for approximating two-terminal reliability
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
This page was built for publication: A dynamic bounding algorithm for approximating multi-state two-terminal reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976369)
