A Revised Layered-Network Algorithm To Search For All D-Minpaths Of A Limited-Flow Acyclic Network

IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:
Journal Article
IEEE Transactions on Reliability, 1998, 47 (4), pp. 436 - 442
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2010004144OK.pdf569.46 kBAdobe PDF
Many real-world systems are multistate and composed of multistate components in which the reliability can be computed in terms of the lower bound points of level d, called d-Minpaths (d-MP). Such systems (electric power, transportation, etc) may be regarded as flow networks whose arcs have statistically independent, discrete, limited, and multimlued random capacities. This study focuses on how to find the entire path of (GMP before calculating the reliability of an acyclic network.
Please use this identifier to cite or link to this item: