A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
From MaRDI portal
Publication:3372522
Recommendations
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Reliability evaluation of network flows with stochastic capacity and cost constraint
- Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
- Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes
- Overall-terminal reliability of a stochastic capacitated-flow network.
Cited in
(13)- A minimal path-based method for computing multistate network reliability
- Reliability evaluation of multi-state systems under cost consideration
- Search for all \(d\)-mincuts of a limited-flow network
- Performance evaluation for a transportation system in stochastic case
- An approximate algorithm for the robust design in a stochastic-flow network
- Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks
- An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
- Assessing the reliability of a multistate logistics network under the transportation cost constraint
- Networked dynamical systems 2016
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- Evaluating the reliability of a novel deterioration-effect multi-state flow network
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability
- 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 novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372522)
