{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:47:38Z","timestamp":1648932458944},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:00:00Z","timestamp":1401408000000},"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":["J Heuristics"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10732-014-9248-z","type":"journal-article","created":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T17:56:53Z","timestamp":1401386213000},"page":"539-560","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic methods for single link shared backup path protection"],"prefix":"10.1007","volume":"20","author":[{"given":"J\u00f8rgen Thorlund","family":"Haahr","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Stidsen","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Zachariasen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,30]]},"reference":[{"key":"9248_CR1","volume-title":"Survivable Networks: Algorithms for Diverse Routing","author":"R Bhandari","year":"1998","unstructured":"Bhandari, R.: Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic, Norwell (1998)"},{"key":"9248_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"G Dahl","year":"1998","unstructured":"Dahl, G., Stoer, M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10, 1\u201311 (1998)","journal-title":"INFORMS J. Comput."},{"key":"9248_CR3","unstructured":"F\u00f8lsgaard, C., Sp\u00e6lling, A.: Sikring af kommunikationsnetv\u00e6rk ved brug af single backup path protection. Bachelor of Engineering Thesis, Technical University of Denmark (DTU) (2007)"},{"key":"9248_CR4","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"9248_CR5","volume-title":"Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS. SONET and ATM Networking","author":"WD Grover","year":"2003","unstructured":"Grover, W.D.: Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS. SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River (2003)"},{"issue":"5","key":"9248_CR6","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.comcom.2009.11.002","volume":"33","author":"Q Guo","year":"2010","unstructured":"Guo, Q., Ho, P.-H., Fu, H.-Y., Janos, T., Mouftah, H.T.: Spare capacity reprovisioning for high availability shared backup path protection connections. Comput. Commun. 33(5), 603\u2013611 (2010)","journal-title":"Comput. Commun."},{"key":"9248_CR7","unstructured":"Haahr, J.T.: Heuristic methods for the shared backup path protection problem. Master thesis, University of Copenhagen, Copenhagen (2010)"},{"key":"9248_CR8","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol. 53. Elsevier Science, Amsterdam (1992)"},{"key":"9248_CR9","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9248_CR10","unstructured":"Laborczi, P., Tapolcai, J., Ho, P.H., Cinkler, T., Recski, A., Mouftah, H.T.: Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Proceedings of the International Workshop on Design Of Reliable Communication Networks (DRCN), pp. 220\u2013227 (2001)"},{"issue":"7","key":"9248_CR11","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"CL Li","year":"1992","unstructured":"Li, C.L., Thomas, M.S., David, S.L.: Finding disjoint paths with different path-costs: complexity and algorithms. Networks 22(7), 653\u2013667 (1992)","journal-title":"Networks"},{"issue":"1","key":"9248_CR12","first-page":"140","volume":"2002","author":"G Li","year":"2002","unstructured":"Li, G., Wang, D., Kalmanek, C., Doverspike, R.: Efficient distributed path selection for shared restoration connections. IEEE INFOCOM 2002(1), 140\u2013149 (2002)","journal-title":"IEEE INFOCOM"},{"issue":"5","key":"9248_CR13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TNET.2003.819071","volume":"11","author":"G Li","year":"2003","unstructured":"Li, G., Wang, D., Kalmanek, C., Doverspike, R.: Efficient distributed restoration path selection for shared mesh restoration. IEEE\/ACM Trans. Netw. 11(5), 761\u2013771 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9248_CR14","unstructured":"Liu, Y.: Spare capacity allocation: model, analysis and algorithm. Phd thesis, University of Pittsburgh, Pittsburgh (2001)"},{"issue":"1","key":"9248_CR15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TNET.2004.842220","volume":"13","author":"Y Liu","year":"2005","unstructured":"Liu, Y., Tipper, D., Siripongwutikorn, P.: Approximating optimal spare capacity allocation by successive survivable routing. IEEE\/ACM Trans. Netw. 13(1), 198\u2013211 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9248_CR16","doi-asserted-by":"crossref","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0-Survivable network design library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, April 2007. http:\/\/sndlib.zib.de , extended version accepted in Networks (2009)","DOI":"10.1002\/net.20371"},{"issue":"1","key":"9248_CR17","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/net.20484","volume":"59","author":"S Orlowski","year":"2012","unstructured":"Orlowski, S., Pi\u00f3ro, M.: Complexity of column generation in network design with path-based survivability mechanisms. Networks 59(1), 132\u2013147 (2012)","journal-title":"Networks"},{"key":"9248_CR18","unstructured":"Ou, C., Zhang, J., Zang, H.,Sahasrabuddhe, L.H., Mukherjee, B.: Near-optimal approaches for shared-path protection. In: ICC \u201903. IEEE International Conference on Communications, pp. 1320\u20131324 (2003)"},{"key":"9248_CR19","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1109\/JLT.2004.825346","volume":"22","author":"C Ou","year":"2004","unstructured":"Ou, C., Jing, Z., Hui, Z., Sahasrabuddhe, L.H., Biswanath, M.: New and improved approaches for shared-path protection in wdm mesh networks. J. Lightwave Technol. 22, 1223\u20131232 (2004)","journal-title":"J. Lightwave Technol."},{"key":"9248_CR20","unstructured":"Phung, Q.V., Nguyen, H.N., Habibi, D., Lo, K.: A shared backup path protection scheme for optical mesh networks. In: 2005 Asia-Pacific Conference on Communications (2005)"},{"key":"9248_CR21","doi-asserted-by":"crossref","unstructured":"Pi\u00f3ro, M., \u015aliwi\u0144ski, T., Zago\u017cd\u017con, M., Dzida, M., Ogryczak, W.: Path generation issues for survivable network design. Computational Science and Its Applications\u2014ICCSA 2008, vol 5073, pp. 820\u2013835. Springer, Berlin\/Heidelberg (2008)","DOI":"10.1007\/978-3-540-69848-7_65"},{"key":"9248_CR22","doi-asserted-by":"crossref","unstructured":"Pisinger, D., R\u00f8pke, S.: Large neighbourhood search. In: Handbook of Metaheuristics, chapt. 13, 2nd edn., pp. 399\u2013420. Springer, New York (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"9248_CR23","first-page":"1","volume":"2002","author":"C Qiao","year":"2002","unstructured":"Qiao, C., Dahai, X.: Distributed partial information management (DPIM) schemes for survivable networks: Part I. IEEE INFOCOM 2002, 1 (2002)","journal-title":"IEEE INFOCOM"},{"key":"9248_CR24","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993","unstructured":"Reeves, C.R. (ed.): Modern Heuristic Techniques for Combinatorial Problems. Wiley, New York (1993)"},{"key":"9248_CR25","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming\u2014CP98, vol. 1520, pp. 417\u2013431. Springer, Berlin\/Heidelberg (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"2","key":"9248_CR26","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20323","volume":"55","author":"T Stidsen","year":"2010","unstructured":"Stidsen, T., Petersen, B., Spoorendonk, S., Zachariasen, M., Rasmussen, K.B.: Optimal routing with failure-independent path protection. Networks 55(2), 125\u2013137 (2010)","journal-title":"Networks"},{"key":"9248_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M Stoer","year":"1993","unstructured":"Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numerische Mathematik 68, 149\u2013167 (1993)","journal-title":"Numerische Mathematik"},{"issue":"2","key":"9248_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325\u2013336 (1984)","journal-title":"Networks"},{"key":"9248_CR29","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)"},{"issue":"1","key":"9248_CR30","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/90.759330","volume":"7","author":"Y Xiong","year":"1999","unstructured":"Xiong, Y., Mason, L.G.: Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE\/ACM Trans. Netw. 7(1), 98\u2013110 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"9248_CR31","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/JLT.2003.808767","volume":"21","author":"Y Xiong","year":"2003","unstructured":"Xiong, Y., Dahai, X.: Achieving fast and bandwidth-efficient shared-path protection. J. Lightwave Technol. 21(2), 365 (2003)","journal-title":"J. Lightwave Technol."},{"key":"9248_CR32","unstructured":"Xu, D., Yang, C., Yizhi, X., Chunming, Q., Xin, H.: On finding disjoint paths in single and dual link cost networks, vol. 1. In: IEEE INFOCOM (2004)"},{"key":"9248_CR33","unstructured":"Xu, D., Chunming, Q., Yizhi, X.: An ultra-fast shared path protection scheme\u2014distributed partial information management, Part II. IEEE International Conference on Network Protocols 344 (2002)"},{"issue":"7","key":"9248_CR34","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1002\/ett.1371","volume":"20","author":"M \u017botkiewicz","year":"2009","unstructured":"\u017botkiewicz, M., Pi\u00f3ro, M., Tomaszewski, A.: Complexity of resilient network optimisation. Eur. Trans. Telecommun. 20(7), 701\u2013709 (2009)","journal-title":"Eur. Trans. Telecommun."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9248-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9248-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9248-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T09:35:56Z","timestamp":1597916156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9248-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,30]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9248"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9248-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,30]]}}}