{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:32:26Z","timestamp":1775010746619,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T00:00:00Z","timestamp":1598313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2221-E-236-004-MY3"],"award-info":[{"award-number":["MOST 107-2221-E-236-004-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 105-2221-E-009-188-MY3"],"award-info":[{"award-number":["MOST 105-2221-E-009-188-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10479-020-03774-7","type":"journal-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T07:02:53Z","timestamp":1598338973000},"page":"225-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reliability evaluation in terms of flow data mining for multistate networks"],"prefix":"10.1007","volume":"311","author":[{"given":"Yi-Kuei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8726-1355","authenticated-orcid":false,"given":"Shin-Guang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,25]]},"reference":[{"issue":"3","key":"3774_CR1","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TR.1986.4335422","volume":"35","author":"MO Ball","year":"1986","unstructured":"Ball, M. O. (1986). Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability, 35(3), 230\u2013238.","journal-title":"IEEE Transactions on Reliability"},{"key":"3774_CR2","doi-asserted-by":"crossref","unstructured":"Chen, S. G. (2014). Reduced recursive inclusion-exclusion principle for the probability of union events. In 2014 IEEE international conference on industrial engineering and engineering management (pp. 1\u20133). Malaysia: Selangor.","DOI":"10.1109\/IEEM.2014.7058590"},{"key":"3774_CR3","unstructured":"Chen, S. G. (2018). A novel approach to search for all solutions of a non-negative linear Diophantine equation. In 24th ISSAT international conference on reliability and quality in design (pp. 55\u201357)."},{"issue":"4","key":"3774_CR4","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/TR.2012.2220897","volume":"61","author":"SG Chen","year":"2012","unstructured":"Chen, S. G., & Lin, Y. K. (2012). Search for all minimal paths in a general large flow network. IEEE Transactions on Reliability, 61(4), 949\u2013956.","journal-title":"IEEE Transactions on Reliability"},{"issue":"2","key":"3774_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., & Karp, R. M. (1972). Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2), 248\u2013264.","journal-title":"Journal of the ACM"},{"key":"3774_CR6","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton, NJ: Princeton University Press."},{"issue":"5","key":"3774_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1080\/24725854.2018.1504358","volume":"51","author":"M Forghani-elahabad","year":"2019","unstructured":"Forghani-elahabad, M., & Kagan, N. (2019). Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint. IISE Transactions, 51(5), 547\u2013558.","journal-title":"IISE Transactions"},{"key":"3774_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/net.3230250306","volume":"25","author":"JS Lin","year":"1995","unstructured":"Lin, J. S., Jane, C. C., & Yuan, J. (1995). On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks, 25, 131\u2013138.","journal-title":"Networks"},{"issue":"13","key":"3774_CR9","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1016\/S0305-0548(00)00039-3","volume":"28","author":"YK Lin","year":"2001","unstructured":"Lin, Y. K. (2001). A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research, 28(13), 1277\u20131285.","journal-title":"Computers and Operations Research"},{"key":"3774_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jocs.2017.09.009","volume":"22","author":"YK Lin","year":"2017","unstructured":"Lin, Y. K., & Chen, S. G. (2017a). A maximal flow method to search for $$ d $$-MPs in stochastic-flow networks. Journal of Computational Science, 22, 119\u2013125.","journal-title":"Journal of Computational Science"},{"issue":"1","key":"3774_CR11","doi-asserted-by":"publisher","first-page":"1750,005\u20131","DOI":"10.1142\/S021853931750005X","volume":"24","author":"YK Lin","year":"2017","unstructured":"Lin, Y. K., & Chen, S. G. (2017b). A merge search approach to find minimal path vectors in multistate networks. International Journal of Reliability, Quality and Safety Engineering, 24(1), 1750,005\u20131\u20131750,005\u201312.","journal-title":"International Journal of Reliability, Quality and Safety Engineering"},{"key":"3774_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03158-6","author":"YK Lin","year":"2019","unstructured":"Lin, Y. K., & Chen, S. G. (2019). An efficient searching method for minimal path vectors in multi-state networks. Annals of Operations Research,. https:\/\/doi.org\/10.1007\/s10479-019-03158-6.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"3774_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s101070100259","volume":"91","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A. (2002). On the history of the transportation and maximum flow problems. Mathematical Programming, 91(3), 437\u2013445.","journal-title":"Mathematical Programming"},{"key":"3774_CR14","first-page":"1","volume":"2019","author":"XZ Xu","year":"2019","unstructured":"Xu, X. Z., Niu, Y. F., & Li, Q. (2019). Efficient enumeration of-minimal paths in reliability evaluation of multistate networks. Complexity, 2019, 1\u201310.","journal-title":"Complexity"},{"issue":"3","key":"3774_CR15","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1109\/TR.2019.2901057","volume":"68","author":"W Yeh","year":"2019","unstructured":"Yeh, W., & Zuo, M. J. (2019). A new subtraction-based algorithm for the $$d$$-MPs for all d problem. IEEE Transactions on Reliability, 68(3), 999\u20131008.","journal-title":"IEEE Transactions on Reliability"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03774-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03774-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03774-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,11]],"date-time":"2022-03-11T12:32:28Z","timestamp":1647001948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03774-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,25]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3774"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03774-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,25]]},"assertion":[{"value":"25 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}