Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, Yi-Kuei | en_US |
dc.contributor.author | Chen, Shin-Guang | en_US |
dc.date.accessioned | 2020-10-05T02:02:02Z | - |
dc.date.available | 2020-10-05T02:02:02Z | - |
dc.date.issued | 1970-01-01 | en_US |
dc.identifier.issn | 0254-5330 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1007/s10479-020-03774-7 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/155454 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Flow data mining | en_US |
dc.subject | Minimum path | en_US |
dc.subject | Lower boundary vectors | en_US |
dc.subject | Exact enumeration | en_US |
dc.subject | Maximum flow | en_US |
dc.title | Reliability evaluation in terms of flow data mining for multistate networks | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1007/s10479-020-03774-7 | en_US |
dc.identifier.journal | ANNALS OF OPERATIONS RESEARCH | en_US |
dc.citation.spage | 0 | en_US |
dc.citation.epage | 0 | en_US |
dc.contributor.department | 工業工程與管理學系 | zh_TW |
dc.contributor.department | Department of Industrial Engineering and Management | en_US |
dc.identifier.wosnumber | WOS:000562703600005 | en_US |
dc.citation.woscount | 0 | en_US |
Appears in Collections: | Articles |