提出了求解度约束最小生成树问题的单亲遗传算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
本文提出了一种基于最小生成树的TSP问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
In order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the TSP.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
应用推荐