首页 | 本学科首页   官方微博 | 高级检索  
     

通讯网络的极小费用树
引用本文:吴英元,门艳春,杜红. 通讯网络的极小费用树[J]. 大学数学, 1997, 0(3)
作者姓名:吴英元  门艳春  杜红
作者单位:天津市塘沽区房产公司,黑龙江矿业学院
摘    要:本文针对MCM91问题B所给的9个通讯站,建立路径最短的数学模型,然后根据虚设站与路径的相互关系,以合并或分解虚设站为线索逐渐修改模型,最后确定的模型费用为134.84,比美国马里兰州里斯勃莱州立大学数学科学系(MCM的Director)B.A.Fusaro提供的原文的费用少1.05.本文新颖之处是改进图论中求最小生成树的方法,创造性地给出一个解决实际问题的新思路.

关 键 词:极小费用树  最短路径  虚设站

The Minimal Cost Tree of Communication Network
Wu Yingyuan. The Minimal Cost Tree of Communication Network[J]. College Mathematics, 1997, 0(3)
Authors:Wu Yingyuan
Abstract:This artical has made a shortest path of mathematical model to the nine communication station given by MCM91 problem B, according to the relation of the imaginary station and path, modify model through compositing or decompositing imaginary station, confirm model cost in 134 84 at last. It is 1 05 little than the artical given by B.A. Fusaro mathematical department of Shalisibelai university in Mulilan state USA. This artical improved the way to produce the minimal generating tree in the graph theory and produced a new way to solve practical problem creatively.
Keywords:minimal cost tree   shortest path   imaginary station.  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号