{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T06:10:51Z","timestamp":1697955051161},"reference-count":14,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7345,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1986,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that existing network algorithms solve the terminal reliability bound problem under limited information about the probabilities of operation of the components. Tightening of the bounds is achieved by introducing bounds on the probabilities that pairs of network components fail. A heuristic algorithm is developed to determine a tighter lower bound. The problem of the upper bound is also addressed. Our approach discards the traditional assumption of statistical independence of components' failures.<\/jats:p>","DOI":"10.1002\/net.3230160307","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T21:17:04Z","timestamp":1178918224000},"page":"319-329","source":"Crossref","is-referenced-by-count":8,"title":["First\u2010and second\u2010order bounds on terminal reliability"],"prefix":"10.1002","volume":"16","author":[{"given":"J. Yael","family":"Assous","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"J. Y.Assous Bounds on network reliability Ph. D. Thesis Northwestern University (1983)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100206"},{"key":"e_1_2_1_4_2","unstructured":"T. B.BrechtandC. J.Colbourn Lower bounds on two\u2010terminal network reliability. CCNG Report E\u2010127 Computer Communications Networks Group University of Waterloo (March 1985)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"L.FrattaandU. G.Montanari A boolean algebra method for computing the terminal reliability in a communication network. IEEE Trans. on Circuit Theory CT\u201020 (1973)203\u2013211.","DOI":"10.1109\/TCT.1973.1083657"},{"key":"e_1_2_1_6_2","first-page":"93","volume-title":"Blocking polyhedia. Graph Theory and its Applications","author":"Fulkerson D. R.","year":"1970"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.2307\/2313491"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040202"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"B. A.MurtaghandM. A.Saunders MINOS: a Large\u2010scale Nonlinear Programming System (for Problems with Linear Constraints): User's Guide. Technical Report SOL 77\u20109 Systems Optimization Laboratory Department of Operations Research Stanford University Palo Alto Cal. (1977).","DOI":"10.21236\/ADA044906"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"A.SatyanarayanaandA.Prabhakar New topological formula and rapid algorithm for reliability analysis of complex networks. IEEE Trans. on Reliability R\u201027 (1978)82\u2013100.","DOI":"10.1109\/TR.1978.5220266"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.6.1027"},{"key":"e_1_2_1_13_2","volume-title":"Probabilistic Reliability: An Engineering Approach","author":"Shooman M.","year":"1968"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322220"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120408"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230160307","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230160307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T02:17:58Z","timestamp":1697854678000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230160307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["10.1002\/net.3230160307"],"URL":"https:\/\/doi.org\/10.1002\/net.3230160307","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}