您当前的位置:
首页 >
文章列表页 >
Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
更新时间:2024-10-14
    • Solving degree-constrained multicast routing problem by a heuristic genetic algorithm

    • Issue 1, Pages: 96-102(2007)
    • CLC: TP18
    • Published:2007

    移动端阅览

  • PAN Yun1, WANG Xing-gang2, FENG Yan-li3, et al. Solving degree-constrained multicast routing problem by a heuristic genetic algorithm[J]. 2007, (1): 96-102. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

806

下载量

2

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Hybrid genetic simulated annealing algorithm based on niching for QoS multicast routing
Research on scenario recognition for THz channels based on mRMR-GA
Low-power-consumption road side unit deployment strategy for urban 2-D 5G Internet of vehicles
Research on task offloading strategy of Internet of vehicles based on improved hybrid genetic algorithm
Research on computing offloading method for maritime observation monitoring sensor network

Related Author

FANG Zhi-min2
YU Jian-jun1
FAN Yi-ming1
ZHANG Jie
LUO Jiao
LIN Feng
WANG Yang
LIAO Xi

Related Institution

Centre for Modern Education Technology,West Branch of Zhejiang University of Technology
Department of Electronics and Information Engineering,West Branch of Zhejiang University of Technology
School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications
School of Information and Communication Engineering, Beijing University of Posts and Telecommunications
Faculty of Electrical Engineering and Computer Science, Ningbo University
0