{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:47Z","timestamp":1773762647001,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1109\/tr.2014.2338253","type":"journal-article","created":{"date-parts":[[2014,7,23]],"date-time":"2014-07-23T20:10:04Z","timestamp":1406146204000},"page":"118-131","source":"Crossref","is-referenced-by-count":42,"title":["Topology Design with Minimal Cost Subject to Network Reliability Constraint"],"prefix":"10.1109","volume":"64","author":[{"given":"Basima","family":"Elshqeirat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sieteng","family":"Soh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Rai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Lazarescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.898572"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2014.2314597"},{"key":"ref32","first-page":"397","article-title":"A practical algorithm for reliable communication network design","volume":"9","author":"elshqeirat","year":"2013","journal-title":"Int J Perform Eng"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/RAMS.1997.571705"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2005.853440"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/24.799845"},{"key":"ref36","year":"0"},{"key":"ref35","author":"cormen","year":"1990","journal-title":"Introduction to Algorithms"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/07408179808966573"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.11.022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2008.01.001"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1080\/07408170903039836","article-title":"Design of reliable communication networks: A hybrid ant colony optimization approach for the design of reliable networks","volume":"42","author":"altiparmak","year":"2010","journal-title":"IIE Trans"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11943952_21"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IMCSIT.2008.4747351"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0952-1976(94)00041-K"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00255-6"},{"key":"ref18","article-title":"Dynamic programming for minimal cost topology with reliability constraint","author":"elshqeirat","year":"2013","journal-title":"Proc Int Conf Commun Softw Netw"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(94)00218-C"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/0740817X.2012.677574","article-title":"A splitting algorithm for network reliability estimation","volume":"45","author":"leslie","year":"2013","journal-title":"IIE Trans"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/24.983401"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TSMCB.2011.2157911","article-title":"A greedy algorithm for faster feasibility evaluation of all?Terminal-reliable networks","volume":"41","author":"won","year":"2011","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/S146902680500160X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00221-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/nem.687"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/24.210272"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/24.589921"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0026-2714(93)90132-I"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-131-2_32"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068217"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/4235.661548"},{"key":"ref20","first-page":"640","article-title":"A self-controlled genetic algorithm for reliable communication network design","author":"gen","year":"2006","journal-title":"IEEE Congr Evol Comput"},{"key":"ref22","first-page":"259","article-title":"Multiple tabu search algorithm for solvingthe topology network design","author":"watcharasitthiwat","year":"2008","journal-title":"Local Search Techniques Focus on Tabu Search"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602535"},{"key":"ref24","first-page":"177","article-title":"Counting spanning trees in grid graphs","volume":"145","author":"desjarlais","year":"2000","journal-title":"Congressus Numerantium"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2010.2055924"},{"key":"ref26","first-page":"723","article-title":"New monte carlo method for estimating network reliability","author":"yeh","year":"1994","journal-title":"Proc Int Conf Comput Ind Eng"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/71.89065"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/7051309\/06862937.pdf?arnumber=6862937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:40:48Z","timestamp":1642005648000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6862937\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":38,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tr.2014.2338253","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}