最小树 meaning in Chinese
minimal tree
Examples
- Algorithm and analysis of fuzzy minimal spanning tree in fluid pipeline networks
流体管网中模糊最小树的算法与分析 - This problem refers to constructing minimum - cost spanning trees constrained by delay , which is known to be np - complete
该问题的目标是创建一棵覆盖源节点和目的节点的代价最小树,且满足端到端时延要求。 - This paper research the mining press the meaning of the spirit system with the principle of basic theories and superior , application that press the windpipe net to compute the analysis method of the system theories , press the present condition of the spirit system to proceed to investigate the research to old factory tin mine of company of yunnan tin industry group , minimum tree principle within " diagram theories " of key problem , adoption that find out the esse , right pressed the windpipe net to proceeds the superior
本文阐述了研究矿山压气系统的意义和压气管网计算的基本理论及优化原理，并运用运筹学的分析方法，对云南锡业集团公司老厂锡矿压气系统的现状进行了详细的调查研究。针对目前老厂锡矿压气系统存在的管网长、漏气多、压力损失大等主要问题，采用“图论”中最小树原理，对压气管网进行了优化研究。 - This paper centers on the algorithms to construct low cost multicast routing trees with qos requirements . now , researches on multicast routing algorithm mainly focus on multicasting algorithm without constraints , delay - constrained and bandwidth reserved multicast routing . in this thesis , firstly , the existing heuristic algorithms for steiner tree problem are summarized ; secondly , a research and analysis is made on genetic algorithms and a kind of multicasting algorithm based on genetic strategy with two populations is proposed ; then , the group multicast routing problem with bandwidth constrained is studied , and by the idea of the algorithm for the kidnap problem , a global heuristic algorithm for the group multicast routing problem is presented ; at last , a new direction of the study , the multicast routing and assignment of wavelength in wdm optical network is studied , on the basis of analysis of the latest research results about raw problem , a multicast algorithm based on flow in wdm optical network is presented
本论文首先综述了无约束多播问题的基础，即最优steiner树问题及其启发式算法；接着对遗传算法进行了研究和分析，并且给出了一种基于双种群遗传策略的多播路由算法和一种求解k阶最小树的正交遗传算法；此外，本论文还研究了有带宽预留机制的组内多播路由问题，并且根据解决多重背包问题的算法思想给出了一种全局启发式组内多播路由算法；最后，本论文对多播路由问题的最新发展领域，即wdm光传送网中多播路由和波长分配问题进行了初步研究，分析了该问题及raw ( routingandassignmentofwavelength )问题的研究现状，并提出了wdm光传送网中基于流量的一种多播路由算法。