A minimal path-based method for computing multistate network reliability

DOI10.1155/2020/8060794zbMath1453.90061OpenAlexW3093532882MaRDI QIDQ2223237

Xiu-Zhen Xu, Can He, Yi-Feng Niu

Publication date: 28 January 2021

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8060794

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Computational investigations of maximum flow algorithms
• A quick inclusion-exclusion technique
• Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
• Evaluating cost and reliability integrated performance of stochastic logistics systems
• A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
• Reliability Evaluation of Multistate Systems with Multistate Components
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
• A simple algorithm for reliability evaluation of a stochastic-flow network with node failure

This page was built for publication: A minimal path-based method for computing multistate network reliability