Title
Fast computation of bounds for two-terminal network reliability.
Abstract
•An algorithm for the computation of two-terminal network reliability is proposed.•The reliability bounds provide an approximate solution for very large networks.•Controlling the execution time the gap between the two bounds is controlled.•Applied on an airplane electrical network with about 4 trillion minpaths.•Used to analyze the Boeing 787 Current Subsystem for the FAA Certification.
Year
DOI
Venue
2014
10.1016/j.ejor.2014.04.035
European Journal of Operational Research
Keywords
Field
DocType
Binary Decision Diagram (BDD),Bounds computation,Large network reliability,Reliability graph,Reliability prediction
Graph,Large networks,Mathematical optimization,Upper and lower bounds,Execution time,Reliability (computer networking),Mathematics,Graph model,Computation
Journal
Volume
Issue
ISSN
238
3
0377-2217
Citations 
PageRank 
References 
9
0.61
37
Authors
4
Name
Order
Citations
PageRank
Stefano Sebastio1121.71
Trivedi, K.S.27721700.23
Dazhi Wang319412.64
Xiaoyan Yin41508.96