Reliability evaluation of a limited-flow network in terms of minimal cutsets

DOI10.1109/24.257817zbMATH Open0795.90028OpenAlexW2134858346MaRDI QIDQ4285196FDOQ4285196

Authors: Chin-Chia Jane, Jsen-Shung Lin, John Yuan 

Publication date: 14 September 1994

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4c3bcd3f65312bc10a11c75a125de08f09e6087e

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

zbMATH Keywords

maximum flowflow networkminimal cutsets\(K\)-latticesmultivalued random capacities

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Cited In (62)

• 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
• Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
• The reliability of systems with stair-type consecutive minimal cuts
• System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing
• 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 study the system capacity for a stochastic-flow network in two-commodity case.
• Search for all \(d\)-mincuts of a limited-flow network
• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
• Performance evaluation for a transportation system in stochastic case
• Reliability evaluation of a multistate network subject to time constraint under routing policy
• Simulation research of space-time evolution of emergency logistics network reliability based on complex network theory
• Reliability of Systems with Consecutive Minimal Cutsets
• A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity
• System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight
• Resource allocation decisions under various demands and cost requirements in an unreliable flow network
• Title not available (Why is that?)
• Optimal resource assignment to maximize multistate network reliability for a computer network
• Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
• System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts
• Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
• Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network
• An improved algorithm for reliability bounds of multistate networks
• An improved algorithm for finding all upper boundary points in a stochastic-flow network
• A simple algorithm to search for all MCs in networks
• Title not available (Why is that?)
• Reliability Evaluation of a Multi-state Network with Multiple Sinks under Individual Accuracy Rate Constraint
• System reliability for quickest path problems under time threshold and budget
• Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
• Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
• 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
• MC-based algorithm for a telecommunication network under node and budget constraints
• Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
• Overall-terminal reliability of a stochastic capacitated-flow network.
• Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
• 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
• Stochastic computer network under accuracy rate constraint from QoS viewpoint
• Multistate components assignment problem with optimal network reliability subject to assignment budget
• Two-commodity reliability evaluation for a stochastic-flow network with node failure
• Time version of the shortest path problem in a stochastic-flow network
• Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute
• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• Topology optimisation of repairable flow networks for a maximum average availability
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case
• Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
• An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
• On transmission time through \(k\) minimal paths of a capacitated-flow network
• Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• Stochastic flow networks via multiple paths under time threshold and budget constraint
• Reliable and economic resource allocation in an unreliable flow network
• Evaluation of network reliability for computer networks with multiple sources
• Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
• Algorithms for an integer multicommodity network flow problem with node reliability considerations
• 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
• A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network

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)