Reliability evaluation in terms of flow data mining for multistate networks

Network reliability is famous for its problem solving ability in several real-life applications. However, due to its NP-hard nature (Ball in IEEE Trans Reliab 35(3):230–238, 1986), researchers are devoted to the improvement of computational efficiency in various approaches. Although flow in networks...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 311; no. 1; pp. 225 - 237
Main Authors: Lin, Yi-Kuei, Chen, Shin-Guang
Format: Journal Article
Language:English
Published: New York Springer US 01.04.2022
Springer
Springer Nature B.V
Subjects:
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Network reliability is famous for its problem solving ability in several real-life applications. However, due to its NP-hard nature (Ball in IEEE Trans Reliab 35(3):230–238, 1986), researchers are devoted to the improvement of computational efficiency in various approaches. Although flow in networks depicts its combination properties, only few of them are useful in the calculation of network reliability. In some point of views, we call it mining in flow data. This paper presents techniques of how to efficiently do the flow data mining tasks. A skill based on backtrack and maximal flow is illustrated with examples and benchmarks. The results show that the proposed approach is valuable in the calculation of network reliability.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-020-03774-7