| 互连网络拓扑优化设计 |
| |
| 引用本文： | 吕光宏,李乐民. 互连网络拓扑优化设计[J]. 电子科技大学学报(社会科学版), 1992, 0(6) |
| |
| 作者姓名： | 吕光宏 李乐民 |
| |
| 作者单位： | 电子科技大学信息所，电子科技大学信息所 成都610054 四川大学计算中心 610064，成都610054 |
| |
| 摘 要： | 论述了互连网络拓扑优化设计问题,建立了必要的数学模型,该数学模型是一个非线性组合优化问题,它属于NP—完备类问题。采取拉格朗日松弛法、次梯度迭代算法和启发式算法,得出最优下确界和结论。
|
| 关 键 词： | 拓扑设计模型 互连网络 拉格朗日松弛法 次梯度迭代法 启发式算法 组合优化 |
THE TOPOLOGICAL OPTIMAL DESIGN OF INTERNETWORKS |
| |
| Lu Guanghong Li Lemin. THE TOPOLOGICAL OPTIMAL DESIGN OF INTERNETWORKS[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 1992, 0(6) |
| |
| Authors: | Lu Guanghong Li Lemin |
| |
| Abstract: | A mathematical mode for the topological design of inter-networks is presented in the paper. It is a non-linear combinatorial optimization problem and belongs to N-P-hard. The Lagrangean relaxation, subgradient optimization and heuristic algorithms for this model are given, a good lower bound to the optimal solution and a useful conclusion are obtained. |
| |
| Keywords: | topological design model internetworks Lagrangean relaxation subgradient iteration heuristic algorithm combinatorial optimization |
| 本文献已被 CNKI 等数据库收录！ |
