欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对网络设计和组合优化中的度约束最小生成树问题,基于第k最小生成树的求解算法,提出了一种求解网络G关于指定节点的最小k度生成树的新算法。该算法通过对网络G的最小生成树作最优可行变换,逐步构造出指定节点的度数越来越接近度约束k的最小i度生成树,最终得到了网络G关于指定节点的最小k度生成树。给出了算法实施的具体步骤,并证明了算法的正确性。最后通过仿真结果和一个运输实例,表明了该算法在解决度约束最小生成树问题中的有效性。
英文摘要：
Regarding the characteristics of degree-constrained minimum spanning tree problem in network design and combi-natorial optimization,a new algorithm for the the k-degree minimum spanning tree on a designated point is presented on the base of the k minimum spanning tree’s algorithm.This new algorithm is supposed to change the minimum spanning tree in the optimal and operable way,and gradually make the degree of the designated point to be closer to the i-degree minimum spanning tree and finally reach the k-degree minimum spanning tree in network G.The correctness of this algorithm is proved by the given specific steps.Finallyt,he simulation and a practical transportation example turn out that the new algo-rithm is effective in the degree constrained minimum spanning tree problem.
同期刊论文项目
同项目期刊论文
Method for uncertain multi-attribute decision-making with preference information in the form of inte
Three symmetric solutions for a class of elliptic equations involving the p-Laplacian with discontin
期刊信息
位置：