A minimal path-based method for computing multistate network reliability
From MaRDI portal
Publication:2223237
DOI10.1155/2020/8060794zbMATH Open1453.90061OpenAlexW3093532882MaRDI QIDQ2223237FDOQ2223237
Authors: Xiu-Zhen Xu, Can He, Yifeng 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
Recommendations
- Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
- An improved algorithm for reliability bounds of multistate networks
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
- A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network
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
- 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
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
- Evaluating cost and reliability integrated performance of stochastic logistics systems
- A quick inclusion-exclusion technique
- Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
Cited In (15)
- Reliability evaluation of multi-state systems under cost consideration
- Reliability evaluation of a multistate network subject to time constraint under routing policy
- Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
- Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
- Reliability of a two‐dimensional demand‐based networked system with multistate components
- An improved algorithm for reliability bounds of multistate networks
- Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Reliability evaluation in terms of flow data mining for multistate networks
- A permutation-and-backtrack approach for reliability evaluation in multistate information networks
- Evaluating the reliability of a novel deterioration-effect multi-state flow network
- An efficient searching method for minimal path vectors in multi-state networks
- Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts
- Reliability evaluation of multi-state systems based on the max-flow theory and decomposition technique
- A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network
This page was built for publication: A minimal path-based method for computing multistate network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223237)
