๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Reliability evaluation of capacitated-flow networks with budget constraints

โœ Scribed by Jsen-shung Lin

Book ID
110251251
Publisher
Taylor and Francis Group
Year
1998
Tongue
English
Weight
133 KB
Volume
30
Category
Article
ISSN
0740-817X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On reliability evaluation of a capacitat
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
โœ Jsen-Shung Lin; Chin-Chia Jane; John Yuan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 648 KB

Many real-world systems such as electric power transmission and distribution systems, transportation systems, and manufacturing systems can be regarded as flow networks whose arcs have independent, finite, and multivalued random capacities. Such a flow network is indeed a multistate system with mult

Unreliability evaluation for a limited-f
Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint
โœ Yi-Kuel Lin ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 431 KB

This paper concentrates on a limited-flow network in which each node and branch has a designated capacity, which will have different lower levels due to various partial and complete failures. VCe try to evaluate the system unreliability that the maximum flow of the network is less than or equal to t

Overall-terminal reliability of a stocha
Overall-terminal reliability of a stochastic capacitated-flow network
โœ Yi-Kuei Lin ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 607 KB

For a stochastic and directed capacitated-flow network in which the capacity of each arc has several possible values, this article generalizes the system reliability problem from single source node and single sink node cases to an overall-terminal case. Given the demand for each node pair simultaneo

Study on the multicommodity reliability
Study on the multicommodity reliability of a capacitated-flow network
โœ Yi-Kuei Lin ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 593 KB

Traditionally, many researchers solved the multicommodity maximum flow problem by assuming that the arcs of the flow network are deterministic. When the arcs are stochastic (i.e., the capacity of each arc has several values), this article studies how to calculate the probability that a capacitated-f