Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Yi-Kueien_US
dc.contributor.authorChen, Shin-Guangen_US
dc.date.accessioned2020-10-05T02:02:02Z-
dc.date.available2020-10-05T02:02:02Z-
dc.date.issued1970-01-01en_US
dc.identifier.issn0254-5330en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10479-020-03774-7en_US
dc.identifier.urihttp://hdl.handle.net/11536/155454-
dc.description.abstractNetwork 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.isoen_USen_US
dc.subjectFlow data miningen_US
dc.subjectMinimum pathen_US
dc.subjectLower boundary vectorsen_US
dc.subjectExact enumerationen_US
dc.subjectMaximum flowen_US
dc.titleReliability evaluation in terms of flow data mining for multistate networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10479-020-03774-7en_US
dc.identifier.journalANNALS OF OPERATIONS RESEARCHen_US
dc.citation.spage0en_US
dc.citation.epage0en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000562703600005en_US
dc.citation.woscount0en_US
Appears in Collections:Articles