{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:24:31Z","timestamp":1725668671571},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642284892"},{"type":"electronic","value":"9783642284908"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28490-8_54","type":"book-chapter","created":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T06:05:53Z","timestamp":1331705153000},"page":"519-528","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Algorithms for Solving Survivability Problem in the Design of Last Mile Communication Networks"],"prefix":"10.1007","author":[{"given":"Vo Khanh","family":"Trung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Thi","family":"Minh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"54_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H. Kerivin","year":"2005","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of survivable networks: A survey. Networks\u00a046(1), 1\u201321 (2005)","journal-title":"Networks"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-69995-8_33","volume-title":"Operations Research Proceedings 2006","author":"D. Wagner","year":"2007","unstructured":"Wagner, D., Raidl, G.R., Pferschy, U., Mutzel, P., Bachhiesl, P.: A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. In: Waldmann, K.H., Stocker, U.M. (eds.) Operations Research Proceedings 2006, pp. 197\u2013202. Springer, Heidelberg (2007)"},{"key":"54_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-88439-2_12","volume-title":"Hybrid Metaheuristics","author":"M. Leitner","year":"2008","unstructured":"Leitner, M., Raidl, G.R.: Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. In: Blesa, M.J., Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol.\u00a05296, pp. 158\u2013174. Springer, Heidelberg (2008)"},{"key":"54_CR4","unstructured":"Leitner, M., Raidl, G.R.: Branch-and-cut and price for capacitated connected facility location. Technical Report TR 186{1{10{01, Vienna University of Technology, Vienna, Austria (2010)"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"Leitner, M., Raidl, G.R.: Strong lower bounds for a survivable network design problem. In: International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Tunisia (March 2010)","DOI":"10.1016\/j.endm.2010.05.038"},{"key":"54_CR6","unstructured":"ILOG: CPLEX 10.0 (2006), \n                    \n                      http:\/\/www.ilog.com"},{"key":"54_CR7","unstructured":"Wagner, D., Pferschy, U., Mutzel, P., Raidl, G.R., Bachhiesl, P.: A directed cut model for the design of the last mile in real-world fiber optic networks. In: Fortz, B. (ed.) Proceedings of the International Network Optimization Conference 2007, Spa, Belgium, pp. 1\u20136, 103 (2007)"},{"key":"54_CR8","unstructured":"Bucsics, T., Raidl, G.: Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks. Institute for Computer Graphics and Algorithms of the Vienna University of Technology (2007)"},{"issue":"2-3","key":"54_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubic","year":"2006","unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, Series B\u00a0105(2-3), 427\u2013449 (2006)","journal-title":"Mathematical Programming, Series B"},{"issue":"6","key":"54_CR10","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1016\/j.dam.2008.02.014","volume":"157","author":"A.S. Cunha da","year":"2009","unstructured":"da Cunha, A.S., Lucena, A., Maculan, N., Resende, M.G.C.: A relax-and-cut algorithm for the prize-collecting Steiner problem in graph. Discrete Applied Mathematics\u00a0157(6), 1198\u20131217 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"1-3","key":"54_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","volume":"141","author":"A. Lucena","year":"2004","unstructured":"Lucena, A., Resende, M.G.C.: Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Applied Mathematics\u00a0141(1-3), 277\u2013294 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks\u00a038, 50\u201358 (2001)","journal-title":"Networks"},{"issue":"4","key":"54_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/net.20106","volume":"47","author":"O. Chapovska","year":"2006","unstructured":"Chapovska, O., Punnen, A.P.: Variations of the prize-collecting Steiner tree problem. Networks\u00a047(4), 199\u2013205 (2006)","journal-title":"Networks"},{"issue":"4","key":"54_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.orl.2005.02.007","volume":"34","author":"E. Uchoa","year":"2006","unstructured":"Uchoa, E.: Reduction tests for the prize-collecting Steiner problem. Operations Research Letters\u00a034(4), 437\u2013444 (2006)","journal-title":"Operations Research Letters"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-0-387-30165-5_15","volume-title":"Handbook of Optimization in Telecommunications","author":"B. Fortz","year":"2006","unstructured":"Fortz, B., Labbe, M.: Polyhedral approaches to the design of survivable networks. In: Resende, M.G.C., Pardolas, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 367\u2013389. Springer, Heidelberg (2006)"},{"key":"54_CR16","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","volume-title":"Design of Survivable Networks","author":"M. Stoer","year":"1992","unstructured":"Stoer, M.: Design of Survivable Networks. LNCS, vol.\u00a01531. Springer, Heidelberg (1992)"},{"key":"54_CR17","unstructured":"Leitner, M.: Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods. PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria (May 2010); supervised by Raidl, G.R., Pferschy, U."},{"key":"54_CR18","unstructured":"Bachhiesl, P.: 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 (2005)"},{"key":"54_CR19","unstructured":"https:\/\/www.ads.tuwien.ac.at\/people\/mleitner\/sndp\/sndpinstances.tar.gz"},{"key":"54_CR20","unstructured":"Minh, N.T., Trung, V.K., Binh, H.T.T.: Heuristic Algorithms for Solving the Survivable Problem in the Design of Last Mile Communication Networks. In: The 9th IEEE \u2013 RIVF International Conference on Computing and Communication Technologies, Ho Chi Minh city, Vietnam, Feburary 27-March 01 (accepted, 2012)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28490-8_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T17:09:56Z","timestamp":1556471396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28490-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284892","9783642284908"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28490-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}