{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:57:26Z","timestamp":1725541046634},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642111686"},{"type":"electronic","value":"9783642111693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11169-3_2","type":"book-chapter","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T21:26:05Z","timestamp":1259357165000},"page":"15-29","source":"Crossref","is-referenced-by-count":12,"title":["A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing"],"prefix":"10.1007","author":[{"given":"Rong","family":"Qu","sequence":"first","affiliation":[]},{"given":"Ying","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/49.564132","volume":"15","author":"H.F. Salama","year":"1997","unstructured":"Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for realtime communication on high-speed networks. IEEE Journal on Selected Areas in Communications\u00a015, 332\u2013345 (1997)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1016\/j.comcom.2004.04.003","volume":"27","author":"C.K. Yeo","year":"2004","unstructured":"Yeo, C.K., Lee, B.S., Er, M.H.: A survey of application level multicast techniques. Computer Communications\u00a027, 1547\u20131568 (2004)","journal-title":"Computer Communications"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.comcom.2005.06.008","volume":"29","author":"X. Masip-Bruin","year":"2006","unstructured":"Masip-Bruin, X., Yannuzzi, M., Domingo-Pascual, J., Fonte, A., Curado, M., Monteiro, E., Kuipers, F., Van Mieghem, P., Avallone, S., Ventre, G., Aranda-Gutierrez, P., Hollick, M., Steinmetz, R., Iannone, L., Salamatian, K.: Research challenges in QoS routing. Computer Communications\u00a029, 563\u2013581 (2006)","journal-title":"Computer Communications"},{"key":"2_CR4","first-page":"55","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S.: Steiner tree problems. IEEE\/ACM Trans. Networking\u00a022, 55\u201389 (1992)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"2_CR5","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.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"2_CR6","unstructured":"Guo, L., Matta, I.: QDMR: An efficient QoS dependent multicast routing algorithm. In: Proceedings of the 5th IEEE Real Time Technology and Applications Symposium, pp. 213\u2013222 (1999)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/49.564128","volume":"15","author":"C. Diot","year":"1997","unstructured":"Diot, C., Dabbous, W., Crowcroft, J.: Multicast communication: a survey of protocols, functions, and mechanisms. IEEE Journal on Selected Areas in Communications\u00a015, 277\u2013290 (1997)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"8","key":"2_CR8","doi-asserted-by":"publisher","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.: A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research\u00a032(8), 1953\u20131981 (2005)","journal-title":"Computers & Operations Research"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella, V.P., Pasquale, J.V., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE\/ACM Transactions on Networking\u00a01, 286\u2013292 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2_CR10","unstructured":"Sun, Q., Langendoerfer, H.: Efficient multicast routing for delay-sensitive applications. In: Proceedings of the 2nd Workshop on Protocols for Multimedia Systems, pp. 452\u2013458 (1995)"},{"key":"2_CR11","first-page":"377","volume-title":"Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communication (INFOCOM 1995)","author":"Q. Zhu","year":"1995","unstructured":"Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for delay-constrained minimum-cost multicasting. In: Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communication (INFOCOM 1995), pp. 377\u2013385. IEEE Computer Society Press, Boston (1995)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/49.564135","volume":"15","author":"A. Shaikh","year":"1997","unstructured":"Shaikh, A., Shin, K.: Destination-driven routing for low-cost multicast. IEEE Journal on Selected Areas in Communications\u00a015, 373\u2013381 (1997)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica\u00a015, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"key":"2_CR14","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1997","unstructured":"Cormen, T.H., Leiserson, C.E., Revest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1997)"},{"key":"2_CR15","volume-title":"Data Networks","author":"D. Betsekas","year":"1992","unstructured":"Betsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)","edition":"2"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal of Computing\u00a028, 652\u2013673 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Wang, X.L., Jiang, Z.: QoS multicast routing based on simulated annealing algorithm. In: Proceedings of International Society for Optical Engineering on Network Architectures, Management, and Applications, pp. 511\u2013516 (2004)","DOI":"10.1117\/12.520383"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1016\/j.comcom.2004.12.003","volume":"28","author":"K. Zhang","year":"2005","unstructured":"Zhang, K., Wang, H., Liu, F.Y.: Distributed multicast routing for delay variation-bounded Steiner tree using simulated annealing. Computer Communications\u00a028, 1356\u20131370 (2005)","journal-title":"Computer Communications"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/S0140-3664(00)00273-5","volume":"24","author":"Z. Wang","year":"2001","unstructured":"Wang, Z., Shi, B., Zhao, E.: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer communications\u00a024, 685\u2013692 (2001)","journal-title":"Computer communications"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0140-3664(03)00185-3","volume":"27","author":"A.T. Haghighat","year":"2004","unstructured":"Haghighat, A.T., Faez, K., Dehghan, M., Mowlaei, A., Ghahremani, Y.: GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications\u00a027, 111\u2013127 (2004)","journal-title":"Computer Communications"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0952-1976(00)00065-8","volume":"14","author":"H. Youssef","year":"2001","unstructured":"Youssef, H., Sait, M., Adiche, H.: Evolutionary algorithms, simulated annealing and tabu search: a comparative study. Engineering Applications of Artificial Intelligence\u00a014, 167\u2013181 (2001)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Skorin-Kapov, N., Kos, M.: The application of steiner trees to delay constrained multicast routing: a tabu search approach. In: Proceedings of the seventh international Conference on Telecommunications, Zagreb, Croatia, pp. 443\u2013448 (2003)","DOI":"10.1109\/CONTEL.2003.176945"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jnca.2003.10.001","volume":"27","author":"H. Wang","year":"2004","unstructured":"Wang, H., Fang, J., Wang, H., Sun, Y.M.: TSDLMRA: an efficient multicast routing algorithm based on tabu search. Journal of Network and Computer Applications\u00a027, 77\u201390 (2004)","journal-title":"Journal of Network and Computer Applications"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Ghaboosi, N., Haghighat, A.T.: A tabu search based algorithm for multicast routing with QoS constraints. In: 9th International Conference on Information Technology, pp. 18\u201321 (2006)","DOI":"10.1109\/ICIT.2006.22"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s11235-006-8202-2","volume":"32","author":"N. Skorin-Kapov","year":"2006","unstructured":"Skorin-Kapov, N., Kos, M.: A GRASP heuristic for the delay-constrained multicast routing problem. Telecommunication Systems\u00a032, 55\u201369 (2006)","journal-title":"Telecommunication Systems"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Ghaboosi, N., Haghighat, A.T.: A path relinking approach for Delay-Constrained Least-Cost Multicast routing problem. In: 19th International Conference on Tools with Artificial Intelligence, pp. 383\u2013390 (2007)","DOI":"10.1109\/ICTAI.2007.17"},{"key":"2_CR27","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"},{"key":"2_CR28","unstructured":"Gruber, M., Raidl, G.R.: Variable neighborhood search for the bounded diameter minimum spanning tree problem. In: Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M., Batista, B.M., Moreno-Vega, J.M. (eds.) Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain (2005)"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"K. Jari","year":"2007","unstructured":"Jari, K., Teemu, N., Olli, B., Michel, G.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research\u00a034, 2743\u20132757 (2007)","journal-title":"Computers & Operations Research"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"2","author":"E.K. Burke","year":"2008","unstructured":"Burke, E.K., Curtois, T.E., Post, G., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research\u00a02, 330\u2013341 (2008)","journal-title":"European Journal of Operational Research"},{"key":"2_CR32","unstructured":"Zhang, B., Mouftah, H.T.: A destination-driven shortest path tree algorithm. In: IEEE International Conference on Communications, pp. 2258\u20132262 (2002)"},{"issue":"1-4","key":"2_CR33","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1026546708757","volume":"17","author":"S.L. Martins","year":"2000","unstructured":"Martins, S.L., Resende, M.G.C., Ribeiro, C.C., Pardalos, P.M.: A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization\u00a017(1-4), 267\u2013283 (2000)","journal-title":"Journal of Global Optimization"},{"key":"2_CR34","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":"2_CR35","doi-asserted-by":"crossref","unstructured":"Sun, Q., Langendoerfer, H.: An efficient delay-constrained multicast routing algorithm. Technical Report, Internal Report, Institute of Operating Systems and Computer Networks. TU Braunschweig, Germany (1997)","DOI":"10.1007\/BFb0000343"},{"key":"2_CR36","first-page":"376","volume":"23","author":"A. Cayley","year":"1989","unstructured":"Cayley, A.: A theorem on trees. Journal of Math.\u00a023, 376\u2013378 (1989)","journal-title":"Journal of Math."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications\u00a06, 1617\u20131622 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2_CR38","unstructured":"Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path relinking for the Steiner problem in graphs. In: Proceedings of the third Metaheuristics International Conference, Angra dos Reis, Brazil (1999)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11169-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T17:47:19Z","timestamp":1685209639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11169-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642111686","9783642111693"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11169-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}