{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:04:23Z","timestamp":1648627463926},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T00:00:00Z","timestamp":1359072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10479-013-1317-4","type":"journal-article","created":{"date-parts":[[2013,1,24]],"date-time":"2013-01-24T10:37:17Z","timestamp":1359023837000},"page":"101-118","source":"Crossref","is-referenced-by-count":0,"title":["Mathematical programming approaches for dual multicast routing problem with multilayer risk cost"],"prefix":"10.1007","volume":"203","author":[{"given":"Zhe","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chungmok","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Art","family":"Chaovalitwongse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,25]]},"reference":[{"key":"1317_CR1","volume-title":"Network flows: theory, algorithms and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnati, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms and applications. New York: Prentice Hall."},{"key":"1317_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/633025.633045","volume-title":"SIGCOMM\u201902: proc. of the 2002 conference on applications, technologies, architectures, and protocols for computer communications","author":"S. Banerjee","year":"2002","unstructured":"Banerjee, S., Bhattacharjee, B., & Kommareddy, C. (2002). Scalable application layer multicast. In SIGCOMM\u201902: proc. of the 2002 conference on applications, technologies, architectures, and protocols for computer communications (pp. 205\u2013217)."},{"key":"1317_CR3","unstructured":"Beasley, J. E. (1990). Or-library: distributing test problems by electronic mail. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/steininfo.html ."},{"key":"1317_CR4","volume-title":"Survivable networks: algorithms for diverse routing","author":"R. Bhandari","year":"1999","unstructured":"Bhandari, R. (1999). Survivable networks: algorithms for diverse routing. Norwell: Kluwer Academic."},{"issue":"1","key":"1317_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L. S. Buriol","year":"2005","unstructured":"Buriol, L. S., Resende, M. G. C., Ribeiro, C. C., & Thorup, M. (2005). A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks, 46(1), 36\u201356.","journal-title":"Networks"},{"issue":"1","key":"1317_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/net.20141","volume":"49","author":"L. S. Buriol","year":"2007","unstructured":"Buriol, L. S., Resende, M. G. C., & Thorup, M. (2007). Survivable IP network design with OSPF routing. Networks, 49(1), 51\u201364.","journal-title":"Networks"},{"key":"1317_CR7","volume-title":"Proceedings of IEEE Global Internet Symposium","author":"M. Cha","year":"2006","unstructured":"Cha, M., Chaovalitwongse, W. A., Moon, S., Shaikh, A., & Yates, J. (2006). Path protection routing with SRLG constraints to support IPTV in WDM mesh networks. In Proceedings of IEEE Global Internet Symposium."},{"issue":"16","key":"1317_CR8","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1016\/j.comnet.2009.07.005","volume":"53","author":"M. Cha","year":"2009","unstructured":"Cha, M., Chaovalitwongse, W. A., Yates, J., Shaikh, A., & Moon, S. (2009). Efficient and scalable provisioning of always-on multicast streaming services. Computer Networks, 53(16), 2825\u20132839.","journal-title":"Computer Networks"},{"key":"1317_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/383059.383064","volume-title":"SIGCOMM\u201901: proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications","author":"Y. Chu","year":"2001","unstructured":"Chu, Y., Rao, S. G., Seshan, S., & Zhang, H. (2001). Enabling conferencing applications on the Internet using an overlay multicast architecture. In SIGCOMM\u201901: proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (pp. 55\u201367)."},{"key":"1317_CR10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/BROADNETS.2004.34","volume-title":"Proc. of the first international conference on broadband networks (BROADNETS)","author":"P. Datta","year":"2004","unstructured":"Datta, P., & Somani, A. K. (2004). Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks. In Proc. of the first international conference on broadband networks (BROADNETS) (pp. 120\u2013129)."},{"key":"1317_CR11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J. Desrocsiers","year":"1984","unstructured":"Desrocsiers, J., Soumis, F., & Desrochers, M. (1984). Routing with time windows by column generation. Networks, 14, 545\u2013565.","journal-title":"Networks"},{"issue":"1","key":"1317_CR12","first-page":"91","volume":"4","author":"G. Ellinas","year":"2003","unstructured":"Ellinas, G., Bouillet, E., Ramamurthy, R., Labourdette, J., Chaudhuri, S., & Bala, K. (2003). Routing and restoration architectures in mesh optical networks. Optical Networks Magazine, 4(1), 91\u2013105.","journal-title":"Optical Networks Magazine"},{"key":"1317_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"issue":"1","key":"1317_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/A:1020359504151","volume":"21","author":"N. Gautam","year":"2002","unstructured":"Gautam, N. (2002). Buffered and unbuffered leaky bucket policing: guaranteeing QoS, design and admission control. Telecommunications Systems, 21(1), 35\u201363.","journal-title":"Telecommunications Systems"},{"key":"1317_CR15","volume-title":"Mesh-based survivable networks","author":"W. D. Grover","year":"2003","unstructured":"Grover, W. D. (2003). Mesh-based survivable networks. New York: Prentice Hall."},{"key":"1317_CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.optcom.2004.11.041","volume":"246","author":"L. Guo","year":"2005","unstructured":"Guo, L., Yu, H., & Li, L. (2005). A new shared-path protection algorithm under shared risk link group constraints for survivable WDM mesh networks. Optics Communications, 246, 285\u2013295.","journal-title":"Optics Communications"},{"issue":"3","key":"1317_CR17","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TCOMM.2003.809779","volume":"51","author":"J. Q. Hu","year":"2003","unstructured":"Hu, J. Q. (2003). Diverse routing in mesh optical networks. IEEE Transactions on Communications, 51(3), 489\u2013494.","journal-title":"IEEE Transactions on Communications"},{"key":"1317_CR18","first-page":"109","volume-title":"Proc. of global telecommunications conference, GLOBECOM\u201905","author":"V. S. Irava","year":"2005","unstructured":"Irava, V. S., & Hauser, C. (2005). Survivable low-cost low-delay multicast trees. In Proc. of global telecommunications conference, GLOBECOM\u201905, 2005 (pp. 109\u2013115)."},{"key":"1317_CR19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner trees in industries","author":"T. Koch","year":"2001","unstructured":"Koch, T., Martin, A., & Voss, S. (2001). SteinLib: an updated library on Steiner tree problems in graphs. In X. Cheng & D.-Z. Zhu (Eds.), Steiner trees in industries (pp. 285\u2013326). Berlin: Springer."},{"key":"1317_CR20","first-page":"265","volume-title":"Proc. 10th annu. ACM symp. theory of computing","author":"J. M. Lewis","year":"1978","unstructured":"Lewis, J. M. (1978). On the complexity of the maximum subgraph problem. In Proc. 10th annu. ACM symp. theory of computing (pp. 265\u2013274)."},{"key":"1317_CR21","first-page":"130","volume-title":"Society of photo-optical instrumentation engineers (SPIE) conference series","author":"G. Li","year":"2001","unstructured":"Li, G., Doverspike, R., & Kalmanek, C. (2001). Fiber span failure protection in mesh optical networks. In Society of photo-optical instrumentation engineers (SPIE) conference series (Vol.\u00a04599, pp.\u00a0130\u2013141)."},{"issue":"2","key":"1317_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10898-009-9497-9","volume":"38","author":"Z. Liang","year":"2010","unstructured":"Liang, Z., & Chaovalitwongse, W. A. (2010). Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models. Journal of Global Optimization, 38(2), 335\u2013345.","journal-title":"Journal of Global Optimization"},{"issue":"10","key":"1317_CR23","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.cor.2009.12.009","volume":"37","author":"Z. Liang","year":"2010","unstructured":"Liang, Z., Chaovalitwongse, W. A., Cha, M., & Moon, S. (2010). Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms. Computers & Operations Research, 37(10), 1731\u20131739.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"1317_CR24","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M. E. Lubbecke","year":"2005","unstructured":"Lubbecke, M. E., & Mesrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"issue":"5","key":"1317_CR25","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/90.803380","volume":"7","author":"M. Medard","year":"1999","unstructured":"Medard, M., Finn, S. G., & Barry, R. A. (1999). Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE\/ACM Transactions on Networking, 7(5), 641\u2013652.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"8","key":"1317_CR26","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C. A. S. Oliveira","year":"2005","unstructured":"Oliveira, C. A. S., & Pardalos, P. M. (2005a). A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research, 32(8), 1953\u20131981.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"1317_CR27","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1007\/s10559-006-0026-2","volume":"41","author":"C. A. S. Oliveira","year":"2005","unstructured":"Oliveira, C. A. S., & Pardalos, P. M. (2005b). Construction algorithms and approximation bounds for the streaming cache placement problems in multicast networks. Cybernetics and Systems Analysis, 41(6), 898\u2013908.","journal-title":"Cybernetics and Systems Analysis"},{"issue":"2","key":"1317_CR28","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1504\/IJOR.2005.007439","volume":"1","author":"C. A. S. Oliveira","year":"2005","unstructured":"Oliveira, C. A. S., Pardalos, P. M., & Querido, T. M. (2005). A combinatorial algorithm for message scheduling on controller area networks. International Journal of Operations Research, 1(2), 160\u2013171.","journal-title":"International Journal of Operations Research"},{"key":"1317_CR29","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/978-0-387-30165-5_25","volume-title":"Handbook of optimization in telecommunications","author":"C. A. S. Oliveira","year":"2006","unstructured":"Oliveira, C. A. S., Pardalos, P. M., & Resende, M. G. C. (2006). Optimization problems in multicast tree construction. In M. G. C. Resende & P. M. Pardalos (Eds.), Handbook of optimization in telecommunications (pp. 701\u2013731). Berlin: Springer."},{"key":"1317_CR30","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00248006","volume":"6","author":"P. Pardalos","year":"1996","unstructured":"Pardalos, P., & Khoury, B. (1996). A heuristic for the steiner problem on graphs. Computational Optimization and Applications, 6, 5\u201314.","journal-title":"Computational Optimization and Applications"},{"key":"1317_CR31","first-page":"902","volume-title":"Proc. of the fifteenth international conference on computer communication (ICCC 2002)","author":"P. Paul","year":"2002","unstructured":"Paul, P., & Raghavan, S. V. (2002). Survey of multicast routing algorithms and protocols. In Proc. of the fifteenth international conference on computer communication (ICCC 2002) (pp. 902\u2013926)."},{"issue":"4","key":"1317_CR32","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/JLT.2002.806338","volume":"21","author":"S. Ramamurthy","year":"2003","unstructured":"Ramamurthy, S., Sahasrabuddhe, L., & Mukherjee, B. (2003). Survivable WDM mesh networks. Journal of Lightwave Technology, 21(4), 870\u2013883.","journal-title":"Journal of Lightwave Technology"},{"key":"1317_CR33","volume-title":"Optical networks: a practical perspective","author":"R. Ramaswami","year":"1998","unstructured":"Ramaswami, R., & Sivarajan, K. (1998). Optical networks: a practical perspective. San Mateo: Morgan Kaufmann."},{"key":"1317_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-30165-5","volume-title":"Handbook of optimization in telecommunications","author":"M. G. C. Resende","year":"2006","unstructured":"Resende, M. G. C., & Pardalos, P. M. (2006). Handbook of optimization in telecommunications. Berlin: Springer."},{"key":"1317_CR35","doi-asserted-by":"crossref","unstructured":"Rosen, E., Viswanathan, A., & Callon, R. (2001). Multiprotocol label switching architecture. IETF, RFC 3031 [Online]. Available: http:\/\/tools.ietf.org\/html\/rfc3031.html .","DOI":"10.17487\/rfc3031"},{"key":"1317_CR36","first-page":"557","volume-title":"Proc. 4th metaheuristics international conference","author":"I. Rosseti","year":"2001","unstructured":"Rosseti, I., de Aragao, M. P., Ribeiro, C. C., Uchoa, E., & Werneck, R. F. (2001). New benchmark instances for the Steiner problem in graphs. In Proc. 4th metaheuristics international conference (pp. 557\u2013591)."},{"key":"1317_CR37","first-page":"269","volume-title":"Computer schedule of public transport urban passenger vehicle and crew scheduling","author":"D. Ryan","year":"1981","unstructured":"Ryan, D., & Foster, B. (1981). An integer programming approach to scheduling. In A. Wren (Ed.), Computer schedule of public transport urban passenger vehicle and crew scheduling (pp. 269\u2013280). Amsterdam: Elsevier"},{"issue":"1","key":"1317_CR38","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/49.974659","volume":"20","author":"L. Sahasrabuddhe","year":"2002","unstructured":"Sahasrabuddhe, L., Ramamurthy, S., & Mukherjee, B. (2002). Fault management in IP-over-WDM networks: WDM protection versus IP restoration. IEEE Journal on Selected Areas in Communications, 20(1), 21\u201333.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"1317_CR39","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/TNET.2005.852879","volume":"13","author":"L. Shen","year":"2005","unstructured":"Shen, L., Yang, X., & Ramanurthy, B. (2005). Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks. IEEE\/ACM Transactions on Networking, 13(4), 918\u2013931.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1317_CR40","first-page":"389","volume-title":"Proceedings of the 12th IEEE international conference and workshops on the engineering of computer-based systems","author":"N. Sheridan-Smith","year":"2005","unstructured":"Sheridan-Smith, N., Leaney, J., O\u2019Neill, T., & Hunter, M. (2005). A policy-driven autonomous system for evolutive and adaptive management of complex services and networks. In Proceedings of the 12th IEEE international conference and workshops on the engineering of computer-based systems (pp. 389\u2013397)."},{"key":"1317_CR41","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/0-387-25486-2_12","volume-title":"Column generation","author":"F. Vanderbeck","year":"2005","unstructured":"Vanderbeck, F. (2005). Implementing mixed integer column generation. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp. 331\u2013358). Berlin: Springer."},{"key":"1317_CR42","volume-title":"Integer programming","author":"L. Wolsey","year":"1998","unstructured":"Wolsey, L. (1998). Integer programming. New York: Wiley."},{"key":"1317_CR43","first-page":"2731","volume-title":"INFOCOM 2004. Twenty-third annual joint conference of the IEEE computer and communications societies","author":"Y. Xin","year":"2004","unstructured":"Xin, Y., & Rouskas, G. N. (2004). Multicast routing under optical layer constraints. In INFOCOM 2004. Twenty-third annual joint conference of the IEEE computer and communications societies (Vol.\u00a04, pp.\u00a02731\u20132742)."},{"key":"1317_CR44","first-page":"253","volume-title":"Proc. 10th annu. ACM symp. theory of computing","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M. (1978). Node- and edge-deletion NP-complete problems. In Proc. 10th annu. ACM symp. theory of computing (pp. 253\u2013264)."},{"key":"1317_CR45","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.comnet.2004.10.013","volume":"48","author":"S. Yuan","year":"2005","unstructured":"Yuan, S., & Jue, J. P. (2005). Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraints. Computer Networks, 48, 91\u2013112.","journal-title":"Computer Networks"},{"issue":"2","key":"1317_CR46","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/TNET.2003.810313","volume":"11","author":"H. Zang","year":"2003","unstructured":"Zang, H., Ou, C., & Mukherjee, B. (2003). Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints. IEEE\/ACM Transactions on Networking, 11(2), 248\u2013258.","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1317-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1317-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1317-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:40Z","timestamp":1559138980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1317-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,25]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1317"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1317-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,25]]}}}