A dynamic bounding algorithm for approximating multi-state two-terminal reliability
From MaRDI portal
Publication:976369
DOI10.1016/j.ejor.2010.01.033zbMath1189.90049OpenAlexW2001854852MaRDI QIDQ976369
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
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items
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, Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks, A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational investigations of maximum flow algorithms
- Practical sequential bounds for approximating two-terminal reliability
- A simple algorithm to search for all MCs in networks
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Computing Network Reliability
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- A sum of disjoint products algorithm for reliability evaluation of flow networks
