Pages that link to "Item:Q4285196"
From MaRDI portal
The following pages link to Reliability evaluation of a limited-flow network in terms of minimal cutsets (Q4285196):
Displaying 50 items.
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate (Q331848) (← links)
- Topology optimisation of repairable flow networks for a maximum average availability (Q356397) (← links)
- Stochastic computer network under accuracy rate constraint from QoS viewpoint (Q497123) (← links)
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network (Q506140) (← links)
- A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network (Q527215) (← links)
- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks (Q534935) (← links)
- Multistate components assignment problem with optimal network reliability subject to assignment budget (Q555430) (← links)
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case (Q621591) (← links)
- System reliability for quickest path problems under time threshold and budget (Q623173) (← links)
- Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget (Q632651) (← links)
- Stochastic flow networks via multiple paths under time threshold and budget constraint (Q660929) (← links)
- Reliability evaluation of multi-state systems under cost consideration (Q693557) (← links)
- A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity (Q864752) (← links)
- System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight (Q878580) (← links)
- System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts (Q883906) (← links)
- Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths (Q958439) (← links)
- On transmission time through \(k\) minimal paths of a capacitated-flow network (Q967798) (← links)
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability (Q976369) (← links)
- Optimal resource assignment to maximize multistate network reliability for a computer network (Q991386) (← links)
- Time version of the shortest path problem in a stochastic-flow network (Q1019780) (← links)
- Overall-terminal reliability of a stochastic capacitated-flow network. (Q1410084) (← links)
- Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case. (Q1422354) (← links)
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks (Q1751923) (← links)
- Performance evaluation for a transportation system in stochastic case (Q1761107) (← links)
- Resource allocation decisions under various demands and cost requirements in an unreliable flow network (Q1781551) (← links)
- Decision diagram based symbolic algorithm for evaluating the reliability of a multistate flow network (Q1793478) (← links)
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network (Q1870808) (← links)
- Reliable and economic resource allocation in an unreliable flow network (Q1886865) (← links)
- Search for all \(d\)-mincuts of a limited-flow network (Q1941957) (← links)
- Two-commodity reliability evaluation for a stochastic-flow network with node failure (Q1941962) (← links)
- Evaluation of network reliability for computer networks with multiple sources (Q1955139) (← links)
- Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute (Q2115786) (← links)
- Algorithms for an integer multicommodity network flow problem with node reliability considerations (Q2247900) (← links)
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks (Q2286903) (← links)
- An improved algorithm for finding all upper boundary points in a stochastic-flow network (Q2289333) (← links)
- Simulation research of space-time evolution of emergency logistics network reliability based on complex network theory (Q2312205) (← links)
- Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget (Q2344678) (← links)
- Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes (Q2370349) (← links)
- MC-based algorithm for a telecommunication network under node and budget constraints (Q2383899) (← links)
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint (Q2432906) (← links)
- An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (Q2458722) (← links)
- Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint (Q2494713) (← links)
- System Reliability Assessment through<i>p</i>Minimal Paths in Stochastic Case with Backup-routing (Q2815376) (← links)
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints (Q2852104) (← links)
- Reliability evaluation of a multistate network subject to time constraint under routing policy (Q2872616) (← links)
- Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion (Q2873096) (← links)
- Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations (Q2876110) (← links)
- ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET (Q2911992) (← links)
- Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network (Q3437468) (← links)
- (Q4999379) (← links)
