Reliability evaluation of a limited-flow network in terms of minimal cutsets
From MaRDI portal
Publication:4285196
Recommendations
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Search for all \(d\)-mincuts of a limited-flow network
- An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
- Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
- scientific article; zbMATH DE number 2186021
Cited in
(63)- Two-commodity reliability evaluation for a stochastic-flow network with node failure
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint
- Reliable and economic resource allocation in an unreliable flow network
- Simulation research of space-time evolution of emergency logistics network reliability based on complex network theory
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Reliability of Systems with Consecutive Minimal Cutsets
- System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts
- Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
- A simple algorithm for reliability evaluation of a stochastic-flow network with node failure
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- Resource allocation decisions under various demands and cost requirements in an unreliable flow network
- Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
- Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute
- System reliability for quickest path problems under time threshold and budget
- Stochastic computer network under accuracy rate constraint from QoS viewpoint
- Overall-terminal reliability of a stochastic capacitated-flow network.
- An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- An improved algorithm for reliability bounds of multistate networks
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
- Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability
- Multistate components assignment problem with optimal network reliability subject to assignment budget
- An improved algorithm for finding all upper boundary points in a stochastic-flow network
- Topology optimisation of repairable flow networks for a maximum average availability
- Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case.
- Performance evaluation for a transportation system in stochastic case
- Time version of the shortest path problem in a stochastic-flow network
- A simple algorithm to search for all MCs in networks
- A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity
- Evaluation of network reliability for computer networks with multiple sources
- Reliability evaluation of a multistate network subject to time constraint under routing policy
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Search for all \(d\)-mincuts of a limited-flow network
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
- Estimation of maintenance reliability for a cloud computing network
- scientific article; zbMATH DE number 2186021 (Why is no real title available?)
- Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
- Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint
- Optimal resource assignment to maximize multistate network reliability for a computer network
- A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- MC-based algorithm for a telecommunication network under node and budget constraints
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- Reliability evaluation of multi-state systems under cost consideration
- Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
- Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
- Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
- An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts
- Reliability evaluation of a multicommodity capacitated-flow network in terms of minimal pathsets
- The reliability of systems with stair-type consecutive minimal cuts
This page was built for publication: Reliability evaluation of a limited-flow network in terms of minimal cutsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285196)
