... Assumptions of shortest Path Problem 最短路问题的假设 Minimum Spanning Tree Problem 最小支撑树问题 The Simple Algorithm 简单的算法 ...
基于6个网页-相关网页
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
以寻找最短的加权送电路径为优化目标，将网络重构建模为一个寻找图的局部最小树问题，并计及各种约束。
应用推荐