【摘要】 论述了互连网络拓扑优化设计问题,建立了必要的数学模型,该数学模型是一个非线性组合优化问题,它属于NP—完备类问题。采取拉格朗日松弛法、次梯度迭代算法和启发式算法,得出最优下确界和结论。更多还原

【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.更多还原