{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:07:00Z","timestamp":1743088020887,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030059828"},{"type":"electronic","value":"9783030059835"}],"license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05983-5_6","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T12:27:46Z","timestamp":1545049666000},"page":"78-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid GRASP\/VND Heuristic for the Design of Highly Reliable Networks"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Bourel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Canale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Robledo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"St\u00e1bile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"12","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1109\/TCS.1987.1086075","volume":"34","author":"D Bauer","year":"1987","unstructured":"Bauer, D., Boesch, F., Suffel, C., Van Slyke, R.: On the validity of a reduction of reliable network design to a graph extremal problem. IEEE Trans. Circuits Syst. 34(12), 1579\u20131581 (1987)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"6_CR2","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Topics in Structural Graph Theory","author":"LW Beineke","year":"2012","unstructured":"Beineke, L.W., Wilson, R.J., Oellermann, O.R.: Topics in Structural Graph Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2012)"},{"key":"6_CR3","series-title":"Cambridge Mathematical Library","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230210204","volume":"21","author":"FT Boesch","year":"1991","unstructured":"Boesch, F.T., Li, X., Suffel, C.: On the existence of uniformly optimally reliable networks. Networks 21(2), 181\u2013194 (1991)","journal-title":"Networks"},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1111\/itor.12159","volume":"22","author":"E Canale","year":"2015","unstructured":"Canale, E., Cancela, H., Robledo, F., Romero, P., Sartor, P.: Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5), 811\u2013821 (2015)","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR6","series-title":"Centre for Research on Transportation","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-1-4615-5087-7_8","volume-title":"Telecommunications Network Planning","author":"CJ Colbourn","year":"1999","unstructured":"Colbourn, C.J.: Reliability issues in telecommunications network planning. In: Sans\u00f2, B., Soriano, P. (eds.) Telecommunications Network Planning. CRT, pp. 135\u2013146. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4615-5087-7_8"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07153-4_9-1","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2016","unstructured":"Duarte, A., Mladenovi\u0107, N., S\u00e1nchez-Oro, J., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Panos, P., Resende, M. (eds.) Handbook of Heuristics, pp. 1\u201327. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_9-1"},{"key":"6_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2553-7","volume-title":"Monte Carlo: Concepts, Algorithms and Applications","author":"GS Fishman","year":"1996","unstructured":"Fishman, G.S.: Monte Carlo: Concepts, Algorithms and Applications. Springer, New York (1996). https:\/\/doi.org\/10.1007\/978-1-4757-2553-7"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Hajek, B., Zhu, J.: The missing piece syndrome in peer-to-peer communication. In: 2010 IEEE International Symposium on Information Theory, pp. 1748\u20131752, June 2010","DOI":"10.1109\/ISIT.2010.5513266"},{"issue":"7","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F Harary","year":"1962","unstructured":"Harary, F.: The maximum connectivity of a graph. Proc. Natl. Acad. Sci. U. S. A. 48(7), 1142\u20131146 (1962)","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"issue":"01","key":"6_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F. Jaeger","year":"1990","unstructured":"Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the Jones and Tutte polynomials. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 108, no. 1, pp. 35\u201353 (1990)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"7","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TMC.2015.2474371","volume":"15","author":"R Jin","year":"2016","unstructured":"Jin, R., et al.: Detecting node failures in mobile wireless networks: a probabilistic approach. IEEE Trans. Mob. Comput. 15(7), 1647\u20131660 (2016)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01904874","volume":"37","author":"AK Kelmans","year":"1981","unstructured":"Kelmans, A.K.: On graphs with randomly deleted edges. Acta Math. Acad. Sci. Hung. 37(1), 77\u201388 (1981)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"72","author":"G Kirchoff","year":"1847","unstructured":"Kirchoff, G.: \u00dcber die aufl\u00f6sung der gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer str\u00f6me gef\u00fchrt wird. Ann. Phys. Chem. 72, 497\u2013508 (1847)","journal-title":"Ann. Phys. Chem."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-319-72926-8_35","volume-title":"Machine Learning, Optimization, and Big Data","author":"G Rela","year":"2018","unstructured":"Rela, G., Robledo, F., Romero, P.: Petersen graph is uniformly most-reliable. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R. (eds.) MOD 2017. LNCS, vol. 10710, pp. 426\u2013435. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72926-8_35"},{"key":"6_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4","volume-title":"Optimization by GRASP - Greedy Randomized Adaptive Search Procedures","author":"MGC Resende","year":"2016","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Optimization by GRASP - Greedy Randomized Adaptive Search Procedures. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-6530-4"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Romero, P.: Building uniformly most-reliable networks by iterative augmentation. In: 9th International Workshop on Resilient Networks Design and Modeling (RNDM), pp. 1\u20137 (2017)","DOI":"10.1109\/RNDM.2017.8093016"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1137\/0132031","volume":"32","author":"A Rosenthal","year":"1977","unstructured":"Rosenthal, A.: Computing the reliability of complex networks. SIAM J. Appl. Math. 32(2), 384\u2013393 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.3230220206","volume":"22","author":"A Satyanarayana","year":"1992","unstructured":"Satyanarayana, A., Schoppmann, L., Suffel, C.L.: A reliability improving graph transformation with applications to network reliability. Networks 22(2), 209\u2013216 (1992)","journal-title":"Networks"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"JS Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"6_CR22","unstructured":"Viera, J.: B\u00fasqueda de grafos c\u00fabicos de m\u00e1xima confiabilidad. Master\u2019s thesis, Facultad de Ingenier\u00eda, Universidad de la Rep\u00fablica, Uruguay (2018)"},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230240504","volume":"24","author":"G Wang","year":"1994","unstructured":"Wang, G.: A proof of Boesch\u2019s conjecture. Networks 24(5), 277\u2013284 (1994)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05983-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:24:10Z","timestamp":1710361450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05983-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"ISBN":["9783030059828","9783030059835"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05983-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Hybrid Metaheuristics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hm2019.ing.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}