A Greedy Branch-And-Bound Inclusion-Exclusion Algorithm For Calculating The Exact Multi-State Network Reliability

IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:
Journal Article
IEEE Transactions On Reliability, 2008, 57 (1), pp. 88 - 93
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004107OK.pdf322.05 kB
Adobe PDF
In this study, a new IE (Inclusion-Exclusion Principle) involving some intuitive properties that characterize the structure of the intersections of d-minimal paths (d-MP)/d-minimal cuts (d-MC), and the relationships between d-MP/d-MC is developed to impr
Please use this identifier to cite or link to this item: