Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1218895
- Study on the multicommodity reliability of a capacitated-flow network
- Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
- Evaluating the reliability of a novel deterioration-effect multi-state flow network
- Reliability evaluation of network flows with stochastic capacity and cost constraint
Cites work
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability
- A new approach to the maximum-flow problem
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- A survey of dynamic network flows
- Algorithms for the constrained quickest path problem and the enumeration of quickest paths
- An efficient alternative to the exact evaluation of the quickest path flow network reliability problem
- Evaluating cost and reliability integrated performance of stochastic logistics systems
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- Fast and fine quickest path algorithm
- Finding the \(k\) quickest simple paths in a network
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 2086912 (Why is no real title available?)
- Internet packet routing: application of a K-quickest path algorithm
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- Permutational methods for performance analysis of stochastic flow networks
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- The all-pairs quickest path problem
- The quickest flow problem
- The quickest path problem
- The quickest transshipment problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(11)- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network
- Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute
- 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
- Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search
- State‐space partition techniques for multiterminal flows in stochastic networks
- Minimum‐cost flow problems having arc‐activation costs
- Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
- Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
- Network reliability evaluation of manufacturing systems by using a deep learning approach
- Effect of reliability on transport delays in networks with maximal flows
This page was built for publication: Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751923)
