{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:15:45Z","timestamp":1648631745306},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T00:00:00Z","timestamp":1408665600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00500-014-1429-z","type":"journal-article","created":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T03:00:21Z","timestamp":1408590021000},"page":"2619-2632","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Heuristic and genetic algorithms for solving survivability problem in the design of last mile communication networks"],"prefix":"10.1007","volume":"19","author":[{"given":"Huynh Thi Thanh","family":"Binh","sequence":"first","affiliation":[]},{"given":"Nguyen Thai","family":"Duong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,22]]},"reference":[{"key":"1429_CR1","unstructured":"Bachhiesl P (2005) The OPT- and the SST-problems for real world access network design basic definitions and test instances. Working report 01\/2005, Carinthia Tech Institue, Department of Telematics and Network Engineering, Klagenfurt, Austria"},{"key":"1429_CR2","first-page":"46","volume":"477","author":"R Bhandari","year":"1999","unstructured":"Bhandari R (1999) Survivable networks: algorithms for diverse routing. Springer Int Ser Eng Comput Sci 477:46","journal-title":"Springer Int Ser Eng Comput Sci"},{"key":"1429_CR3","unstructured":"Bucsics T (2007) Metaheuristic approaches for designing survivable fiber-optic networks. Master\u2019s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria"},{"key":"1429_CR4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"SA Canuto","year":"2001","unstructured":"Canuto SA, Resende MGC, Ribeiro CC (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38:50\u201358","journal-title":"Networks"},{"issue":"4","key":"1429_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/net.20106","volume":"47","author":"O Chapovska","year":"2006","unstructured":"Chapovska O, Punnen AP (2006) Variations of the prize-collecting Steiner tree problem. Networks 47(4):199\u2013205","journal-title":"Networks"},{"key":"1429_CR6","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. The MIT Press, Cambridge","edition":"3"},{"issue":"6","key":"1429_CR7","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.dam.2008.02.014","volume":"157","author":"AS Cunha Da","year":"2009","unstructured":"Da Cunha AS, Lucena A, Maculan N, Resende MGC (2009) A relax-and-cut algorithm for the prize-collecting Steiner problem in graph. Discrete Appl Math 157(6):1198\u20131217","journal-title":"Discrete Appl Math"},{"key":"1429_CR8","unstructured":"IBM (2006) ILOG CPLEX optimizer performance benchmarks 10.0. http:\/\/www.cs.cornell.edu\/w8\/iisi\/ilog\/cplex100\/index.html . Accessed 15 Aug 2014"},{"key":"1429_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin H, Mahjoub AR (2005) Design of survivable networks: a survey. Networks 46:1\u201321","journal-title":"Networks"},{"key":"1429_CR10","unstructured":"Leitner M (2010) Solving two network design problems by mixed integer programming and hybrid optimization methods. Ph.D. thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria"},{"key":"1429_CR11","doi-asserted-by":"crossref","unstructured":"Leitner M, Raidl GR (2008) Lagrangian decomposition, meta-heuristics, and hybrid approaches for the design of the last mile in fiber optic networks. In: Blesa MJ et al (ed) Hybrid Metaheuristics, LNCS, vol 5296. Springer, Berlin, Heidelberg, pp 158\u2013174","DOI":"10.1007\/978-3-540-88439-2_12"},{"key":"1429_CR12","doi-asserted-by":"crossref","unstructured":"Leitner M, Raidl GR (2010) Strong lower bounds for a survivable network design problem. International symposium on combinatorial optimization. Hammamet, Tunisia, pp 295\u2013302","DOI":"10.1016\/j.endm.2010.05.038"},{"issue":"2\u20133","key":"1429_CR13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107 I, Weiskircher R, Pferschy U, Klau G, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math Program Ser B 105(2\u20133):427\u2013449","journal-title":"Math Program Ser B"},{"issue":"1\u20133","key":"1429_CR14","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","volume":"141","author":"A Lucena","year":"2004","unstructured":"Lucena A, Resende MGC (2004) Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl Math 141(1\u20133):277\u2013294","journal-title":"Discrete Appl Math"},{"key":"1429_CR15","doi-asserted-by":"crossref","unstructured":"Nakayama MK (2002) Simulation output analysis. In: Proceedings of the winter simulation conference, pp 23\u201334","DOI":"10.1109\/WSC.2002.1172864"},{"key":"1429_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen MT, Vo TK, Huynh BTT (2012) Heuristic algorithms for solving the survivable problem in the design of last mile communication networks. In: Proceedings of the 9th IEEE-RIVF international conference on computing and communication technologies, Ho Chi Minh, Vietnam, pp 1\u20136","DOI":"10.1109\/rivf.2012.6169858"},{"issue":"4","key":"1429_CR17","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.orl.2005.02.007","volume":"34","author":"E Uchoa","year":"2006","unstructured":"Uchoa E (2006) Reduction tests for the prize-collecting Steiner problem. Oper Res Lett 34(4):437\u2013444","journal-title":"Oper Res Lett"},{"key":"1429_CR18","unstructured":"Vo TK, Nguyen MT, Huynh BTT (2012) Heuristic algorithms for solving survivability problem in the design of last mile communication network. In: Proceedings of the 4th Asian conference on intelligent information and database systems, Kaohsiung, Taiwan, pp 519\u2013528"},{"key":"1429_CR19","unstructured":"Wagner D, Pferschy U, Mutzel P, Raidl GR, Bachhiesl P (2007) A directed cut model for the design of the last mile in real-world fiber optic networks. In: Proceedings of the international network optimization conference 2007, Spa, Belgium, pp 1\u20136"},{"key":"1429_CR20","doi-asserted-by":"crossref","unstructured":"Wagner D, Raidl GR, Pferschy U, Mutzel P, Bachhiesl P (2007) A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. In: Waldmann KH, Stocker UM (ed) Operations research proceedings, vol 2006, pp 197\u2013202","DOI":"10.1007\/978-3-540-69995-8_33"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1429-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1429-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1429-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:41Z","timestamp":1559079821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1429-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,22]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1429"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1429-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,22]]}}}