An Ant Colony System Algorithm for the Multicast Routing Problem
暂无分享,去创建一个
Yuan Zhang | Jun Zhang | Jing Xiao | Ying Lin | Huachun Cai
[1] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[2] George Markowsky,et al. A fast algorithm for Steiner trees , 1981, Acta Informatica.
[3] Yee Leung,et al. A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..
[4] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[5] Anoop Ghanwani,et al. Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..
[6] V. J. Rayward-Smith,et al. The computation of nearly minimal Steiner trees in graphs , 1983 .
[7] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[8] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[9] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[10] Joseph Naor,et al. Resource optimization in QoS multicast routing of real-time multimedia , 2004, IEEE/ACM Transactions on Networking.
[11] K. Chao,et al. Steiner Minimal Trees , 2005 .
[12] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[13] Robert L. Kruse,et al. Data structures and program design in C , 1986 .
[14] K. Bharath-Kumar,et al. Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..