{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:22:20Z","timestamp":1775179340468,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T00:00:00Z","timestamp":1549497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10479-019-03158-6","type":"journal-article","created":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T06:52:52Z","timestamp":1549522372000},"page":"333-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["An efficient searching method for minimal path vectors in multi-state networks"],"prefix":"10.1007","volume":"312","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":[[2019,2,7]]},"reference":[{"key":"3158_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TCOM.1975.1092838","volume":"23","author":"KK Aggarwal","year":"1975","unstructured":"Aggarwal, K. K., Gupta, J. S., & Misra, K. B. (1975). A simple method for reliability evaluation of a communication system. IEEE Transactions on Communications, 23, 563\u2013565.","journal-title":"IEEE Transactions on Communications"},{"key":"3158_CR2","doi-asserted-by":"crossref","unstructured":"Chen, S. G. (2013). Efficiency improvement in explicit enumeration for integer programming problems. In 2013 IEEE international conference on industrial engineering and engineering management, Bangkok, Thailand (pp 98\u2013100).","DOI":"10.1109\/IEEM.2013.6962382"},{"key":"3158_CR3","doi-asserted-by":"crossref","unstructured":"Chen, S. G. (2014a). Reduced recursive inclusion\u2013exclusion principle for the probability of union events. In 2014 IEEE international conference on industrial engineering and engineering management (pp. 1\u20133). Selangor, Malaysia.","DOI":"10.1109\/IEEM.2014.7058590"},{"key":"3158_CR4","unstructured":"Chen, S. G. (2014b). Reduced recursive sum of disjoint product in network reliability. In 2014 the 20th ISSAT international conference on reliability and quality in design (pp. 170\u2013173). Seattle, Washington, USA."},{"key":"3158_CR5","doi-asserted-by":"crossref","unstructured":"Chen, S. G. (2016). Optimal re-arrangement in fast enumeration for integer programming problems. In 2016 IEEE international conference on industrial engineering and engineering management, (pp 1255\u20131258).","DOI":"10.1109\/IEEM.2016.7798079"},{"issue":"4","key":"3158_CR6","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"},{"key":"3158_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jocs.2016.05.011","volume":"17","author":"SG Chen","year":"2016","unstructured":"Chen, S. G., & Lin, Y. K. (2016). Searching for $$d$$-MPs with fast enumeration. Journal of Computational Science, 17, 139\u2013147.","journal-title":"Journal of Computational Science"},{"key":"3158_CR8","volume-title":"The combinatorics of network reliability","author":"CJ Colbourn","year":"1987","unstructured":"Colbourn, C. J. (1987). The combinatorics of network reliability. Oxford: Oxford University Press."},{"key":"3158_CR9","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press."},{"key":"3158_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TR.1980.5220695","volume":"29","author":"SH Lee","year":"1980","unstructured":"Lee, S. H. (1980). Reliability evaluation of a flow network. IEEE Transactions on Reliability, 29, 24\u201326.","journal-title":"IEEE Transactions on Reliability"},{"key":"3158_CR11","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":"3158_CR12","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":"3158_CR13","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":"3158_CR14","doi-asserted-by":"publisher","first-page":"1750005-1","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), 1750005-1\u20131750005-12.","journal-title":"International Journal of Reliability, Quality and Safety Engineering"},{"issue":"3","key":"3158_CR15","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TR.2007.902788","volume":"56","author":"JE Ramirez-Marquez","year":"2007","unstructured":"Ramirez-Marquez, J. E., & Gebre, B. A. (2007). A classification tree based approach for the development of minimal cut and path vectors of a capacitated network. IEEE Transaction on Reliability, 56(3), 474\u2013487.","journal-title":"IEEE Transaction on Reliability"},{"key":"3158_CR16","doi-asserted-by":"crossref","unstructured":"Rebaiaia, M. L., Ait-Kadi, D. (2012). An efficient algorithm for enumerating minimal pathsets in communication networks. In 4th international conference on networked digital technologies, Springer, Berlin, Dubai, UAE, communications in computer and information science, (Vol. 293, pp. 444\u2013458)","DOI":"10.1007\/978-3-642-30507-8_38"},{"issue":"4","key":"3158_CR17","first-page":"329","volume":"34","author":"J Xue","year":"1985","unstructured":"Xue, J. (1985). On multistate system analysis. IEEE Transactions on Reliability, 34(4), 329\u2013337.","journal-title":"IEEE Transactions on Reliability"},{"key":"3158_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0951-8320(01)00032-1","volume":"73","author":"WC Yeh","year":"2001","unstructured":"Yeh, W. C. (2001). A simple algorithm to search for all $$d$$-MPs with unreliable nodes. Reliability Engineering and System Safety, 73, 49\u201354.","journal-title":"Reliability Engineering and System Safety"},{"issue":"1","key":"3158_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s001700200127","volume":"20","author":"WC Yeh","year":"2002","unstructured":"Yeh, W. C. (2002). A simple method to verify all $$d$$-minimal path candidates of a limited-flow network and its reliability. The International Journal of Advanced Manufacturing Technology, 20(1), 77\u201381.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"3158_CR20","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1080\/07408170601013653","volume":"39","author":"MJ Zuo","year":"2007","unstructured":"Zuo, M. J., Tian, Z., & Huang, H. Z. (2007). An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Transactions, 39, 811\u2013817.","journal-title":"IIE Transactions"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-019-03158-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03158-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03158-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T17:19:15Z","timestamp":1652289555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-019-03158-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["3158"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03158-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,7]]},"assertion":[{"value":"7 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}