Reliability evaluation in terms of flow data mining for multistate networks
From MaRDI portal
Publication:2115808
Recommendations
- scientific article; zbMATH DE number 1218895
- A minimal path-based method for computing multistate network reliability
- Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- An efficient searching method for minimal path vectors in multi-state networks
- Computational Complexity of Network Reliability Analysis: An Overview
- Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- On the history of the transportation and maximum flow problems
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(3)- A hybrid method to solve reliability-cost-oriented bi-objective machine configuration problem for a flow shop system
- A permutation-and-backtrack approach for reliability evaluation in multistate information networks
- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network
This page was built for publication: Reliability evaluation in terms of flow data mining for multistate networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115808)