{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:17:18Z","timestamp":1725668238854},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/drcn.2019.8713756","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:23:30Z","timestamp":1558027410000},"page":"91-98","source":"Crossref","is-referenced-by-count":1,"title":["Building Highly Reliable Networks with GRASP\/VND Heuristics"],"prefix":"10.1109","author":[{"given":"Mathias","family":"Bourel","sequence":"first","affiliation":[]},{"given":"Eduardo","family":"Canale","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Robledo","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Romero","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Stabile","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"journal-title":"Algebraic Graph Theory Cambridge Math Library","year":"1993","author":"biggs","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220206"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01904874"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210204"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240504"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/RNDM.2017.8093016"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-3-319-72926-8_35","article-title":"Petersen graph is uniformly most-reliable","author":"rela","year":"2018","journal-title":"Machine Learning Optimization and Big Data Cham Springer International Publishing"},{"journal-title":"Büsqueda de grafos cübicos de máxima confiabilidad","year":"2018","author":"viera","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2474371"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12159"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0132031"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513266"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1987.1086075"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"journal-title":"Topics in Structural Graph Theory ser Encyclopedia of Mathematics and its Applications","year":"2012","author":"beinckc","key":"ref2"},{"key":"ref1","first-page":"135","article-title":"Reliability issues in telecommunications network planning","author":"colboum","year":"1999","journal-title":"Telecommunications network planning chapter 9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.48.7.1142"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100068936"},{"key":"ref22","first-page":"1","author":"duarte","year":"2016","journal-title":"Variable Neighborhood Descent Cham Springer International Publishing"},{"journal-title":"Monte Carlo Concepts Algorithms and Applications","year":"1996","author":"fishman","key":"ref21"},{"key":"ref23","article-title":"Optimization by GRASP - Greedy randomize Adaptive Search Procedures, ser","author":"resende","year":"2016","journal-title":"Computational Science and Engineering"}],"event":{"name":"2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)","start":{"date-parts":[[2019,3,19]]},"location":"Coimbra, Portugal","end":{"date-parts":[[2019,3,21]]}},"container-title":["2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8703491\/8713615\/08713756.pdf?arnumber=8713756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:25:19Z","timestamp":1658247919000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713756\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/drcn.2019.8713756","relation":{},"subject":[],"published":{"date-parts":[[2019,3]]}}}