{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:17Z","timestamp":1725516377006},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698401"},{"type":"electronic","value":"9783540698487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69848-7_65","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"820-835","source":"Crossref","is-referenced-by-count":2,"title":["Path Generation Issues for Survivable Network Design"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Pi\u00f3ro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"\u015aliwi\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Zago\u017cd\u017con","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateusz","family":"Dzida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W\u0142odzimierz","family":"Ogryczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","volume-title":"Routing, Flow, and Capacity Design in Communication and Computer Networks","author":"M. Pi\u00f3ro","year":"2004","unstructured":"Pi\u00f3ro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman, San Francisco (2004)"},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Minoux, M., Serrault, J.Y.: Subgradient optimization and large scale programming: an application to optimum multicommodity network synthesis with security constraints. R.A.I.R.O. Operations Research\u00a015(2) (1981)","DOI":"10.1051\/ro\/1981150201851"},{"key":"65_CR3","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 Journal on Computing\u00a010, 1\u201311 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"65_CR4","unstructured":"Wess\u00e4ly, R.: Dimensioning Survivable Capacitated NETworks. PhD thesis, Technische Universit\u00e4t Berlin (2000)"},{"issue":"3","key":"65_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"J. Hu","year":"2003","unstructured":"Hu, J.: Diverse routing in optical mesh networks. IEEE Trans. Com.\u00a051(3), 489\u2013494 (2003)","journal-title":"IEEE Trans. Com."},{"key":"65_CR6","unstructured":"Maurras, J.F., Vanier, S.: Network synthesis under survivability constraints. 4OR (2), 52\u201367 (2004)"},{"key":"65_CR7","unstructured":"Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.E.: Complexity and approximability issues of shared risk resource group. Technical report, Technical report 5859, INRIA (2006)"},{"key":"65_CR8","unstructured":"Stidsen, T., Petersen, B., Rasmussen, K., Spoorendonk, S., Zachariasen, M., Rambach, F., Kiese, M.: Optimal routing with single backup path protection. In: International Network Optimization Conference INOC 2007, Spa, Belgium (2007)"},{"key":"65_CR9","unstructured":"Bashllari, A., Nace, D., Rourdin, E., Klopfenstein, O.: The MMF rerouting computation problem. In: International Network Optimization Conference INOC 2007, Spa, Belgium (2007)"},{"key":"65_CR10","unstructured":"Orlowski, S., Pi\u00f3ro, M.: On the complexity of column geneartion in survivable network design. Technical report, Zuse Institut Berlin and Warsaw University of Technology (2007)"},{"key":"65_CR11","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"65_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column Generation","author":"S. Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosier, J., Solomon, M. (eds.) Column Generation, pp. 33\u201365. Springer, Heidelberg (2005)"},{"issue":"1","key":"65_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10922-005-1855-4","volume":"13","author":"A. Koster","year":"2005","unstructured":"Koster, A., Zymolka, A., J\u00e4ger, M., H\u00fclsermann, R.: Demand-wise shared protection for meshed optical networks. Journal of Network and Systems Management\u00a013(1), 35\u201355 (2005)","journal-title":"Journal of Network and Systems Management"},{"key":"65_CR14","unstructured":"Wess\u00e4ly, R., Orlowski, S., Zymolka, A., Koster, A., Gruber, C.: Demand-wise shared protection revisited: A new model for survivable network design. In: Proc. INOC 2005, Lisbon, pp. 100\u2013105 (2005)"},{"key":"65_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: The decomposition algorithm for linear programming. Operations Research\u00a08, 101\u2013111 (1960)","journal-title":"Operations Research"},{"key":"65_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-387-25486-2_1","volume-title":"column generation","author":"J. Desrosiers","year":"2005","unstructured":"Desrosiers, J., Luebbecke, M.: A primer in column generation. In: Desaulniers, G., Desrosier, J., Solomon, M. (eds.) column generation, pp. 1\u201332. Springer, Heidelberg (2005)"},{"key":"65_CR17","unstructured":"Orlowski, S.: Local and global restoration of node and link failures in telecommunication networks. M.sc. thesis, Technische Universit\u00e4t Berlin (2003), http:\/\/www.zib.de\/orlowski\/"},{"key":"65_CR18","doi-asserted-by":"crossref","unstructured":"Strand, J., Chiu, A.L., Tkach, R.: Issues for routing in the optical layer. IEEE Communications Magazine, 81\u201387 (2001)","DOI":"10.1109\/35.900635"},{"key":"65_CR19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Management Science\u00a017, 712\u2013716 (1971)","journal-title":"Management Science"},{"key":"65_CR20","unstructured":"McCallum, C.J.: An algorithm for finding the k shortest paths in a network. Bell Laboratories Technical Memorandum TM73-1713-9 (1973)"},{"key":"65_CR21","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Finding the k shortest paths. In: 35 th IEEE Symposium on Foundations of Computer Science, pp. 154\u2013165 (1994)","DOI":"10.1109\/SFCS.1994.365697"},{"key":"65_CR22","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1999","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research\u00a017, 395\u2013412 (1999)","journal-title":"Operations Research"},{"key":"65_CR23","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: Computing the k shortest paths: A new algorithm and an experimental comparison. In: Proceedings of 3 rd Annual Workshop on Algorithmic Engineering, London (1999)","DOI":"10.1007\/3-540-48318-7_4"},{"key":"65_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0305-0548(03)00250-8","volume":"32","author":"M.M.B. Pascoal","year":"2005","unstructured":"Pascoal, M.M.B., Eug\u00e9nia, M., Captivo, V., Climaco, J.C.N.: An algorithm for ranking quickest simple paths. Computers and Operations Research\u00a032, 509\u2013520 (2005)","journal-title":"Computers and Operations Research"},{"key":"65_CR25","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2013Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007), http:\/\/sndlib.zib.de"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69848-7_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:03:44Z","timestamp":1605762224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69848-7_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540698401","9783540698487"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69848-7_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}