{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:48:56Z","timestamp":1774964936941,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00088-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"849-868","source":"Crossref","is-referenced-by-count":100,"title":["Estimation of all-terminal network reliability using an artificial neural network"],"prefix":"10.1016","volume":"29","author":[{"given":"Chat","family":"Srivaree-ratana","sequence":"first","affiliation":[]},{"given":"Abdullah","family":"Konak","sequence":"additional","affiliation":[]},{"given":"Alice E.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00088-5_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/24.210272","article-title":"Topological optimization of a communication network subject to a reliability constraint","volume":"42","author":"Jan","year":"1993","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0026-2714(82)90007-5","article-title":"Topological layout of links for optimising the overall reliability in a computer communication system","volume":"22","author":"Aggarwal","year":"1982","journal-title":"Microelectronics and Reliability"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB3","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/0026-2714(84)90019-2","article-title":"Network topology for maximizing the terminal reliability in a computer communication network","volume":"24","author":"Chopra","year":"1984","journal-title":"Microelectronics & Reliability"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB4","doi-asserted-by":"crossref","unstructured":"Deeter DL, Smith AE. Heuristic optimization of network design considering all-terminal reliability. Proceedings of the Reliability and Maintainability Symposium, 1997. p. 194\u20139.","DOI":"10.1109\/RAMS.1997.571705"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB5","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1080\/07408179808966573","article-title":"Economic design of reliable networks","volume":"30","author":"Deeter","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/24.589921","article-title":"Efficient optimization of all-terminal reliable networks using an evolutionary approach","volume":"46","author":"Dengiz","year":"1997","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/4235.661548","article-title":"Local search genetic algorithm for optimal design of reliable networks","volume":"1","author":"Dengiz","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB8","first-page":"63","article-title":"Topological optimization of communication networks subject to reliability constraints","volume":"15","author":"Venetsanopoulos","year":"1986","journal-title":"Problem of Control and Information Theory"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB9","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0167-5060(08)70726-X","article-title":"Backtracking algorithms for network reliability analysis","volume":"1","author":"Ball","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TR.1981.5220952","article-title":"Reliability evaluation in computer-communication networks","volume":"R-30","author":"Aggarwal","year":"1981","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TCOM.1975.1092859","article-title":"Cutset manipulations for communication network reliability estimation","volume":"Com-23","author":"Cavers","year":"1975","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB13","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/TR.1982.5221415","article-title":"A cutset approach to reliability evaluation in communication networks","volume":"R-31","author":"Rai","year":"1982","journal-title":"IEEE Transactions on Reliability"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB14","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB15","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1287\/opre.34.4.581","article-title":"A Monte Carlo sampling plan for estimating network reliability","volume":"34","author":"Fishman","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB16","unstructured":"Yeh M-S, Lin J-S, Yeh W-C. A new Monte Carlo method for estimating network reliability. Proceedings of the 16th International Conference on Computers & Industrial Engineering, 1994. p. 723\u20136."},{"key":"10.1016\/S0305-0548(00)00088-5_BIB17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1214\/ss\/1177010638","article-title":"Neural networks: a review from a statistical perspective","volume":"9","author":"Cheng","year":"1994","journal-title":"Statistical Science"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/neco.1992.4.1.1","article-title":"Neural networks and the bias\/variance dilemma","volume":"4","author":"Geman","year":"1992","journal-title":"Neural Computation"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0893-6080(89)90003-8","article-title":"On the approximate realization of continuous mappings by neural networks","volume":"2","author":"Funahashi","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","article-title":"Multilayer feedforward networks are universal approximators","volume":"2","author":"Hornik","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB21","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/0893-6080(90)90004-5","article-title":"Connectionist nonparametric regression: multilayer feedforward networks can learn arbitrary mappings","volume":"3","author":"White","year":"1990","journal-title":"Neural Networks"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB22","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0305-0548(95)00056-9","article-title":"Solving the redundancy allocation problem using a combined neural network\/genetic algorithm approach","volume":"23","author":"Coit","year":"1996","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB23","unstructured":"Werbos PJ. Beyond regression: new tools for prediction and analysis in the behavioral sciences. Unpublished PhD thesis, Harvard University, 1974."},{"key":"10.1016\/S0305-0548(00)00088-5_BIB24","unstructured":"Neuralworks reference guide and software. NeuralWare, Pittsburgh, PA, various years."},{"key":"10.1016\/S0305-0548(00)00088-5_BIB25","unstructured":"Konak A, Smith AE. A general upperbound for all-terminal network reliability and its uses. Proceedings of the Industrial Engineering Research Conference, Banff, Canada, May 1998, CD Rom format."},{"key":"10.1016\/S0305-0548(00)00088-5_BIB26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)90093-X","article-title":"Design of reliable networks","volume":"20","author":"Jan","year":"1993","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00088-5_BIB27","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/5326.704579","article-title":"Bias and variance of validation methods for function approximation neural networks under conditions of sparse data","volume":"28","author":"Twomey","year":"1998","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000885?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000885?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:52Z","timestamp":1556522872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000885"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00088-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}