计算机与数字工程2017，Vol.45Issue(10)：1900-1902,3.DOI:10.3969/j.issn.1672-9722.2017.10.002
关于通信结点连接问题的优化模型
Optimization Model For Communications Node Connection Problem
摘要
Abstract
This paper uses Kruskal algorithm to get the communication network connection cost minimization.For the sake of safety and reliability,requirements in addition to a fixed two nodes in the network,any other three nodes are destroyed,it will still be able to keep this communication between two nodes.In this paper,LINGO program is used to traversal the optimal solution.This article also use the Matlab software,using exhaustive method as the core,to terra dix Dijkstra algorithm and 0-1 programming as auxiliary and write a program,as far as possible to iterate through all possible solutions.Final results are consistent with the results using LINGO software,fully proved the accuracy of the answers.关键词
最小生成树/Kruskal算法/穷举法/0-1规划Key words
minimum spanning tree/Kruskal algorithm/exhaustive method/0-1 programming分类
信息技术与安全科学引用本文复制引用
桂改花..关于通信结点连接问题的优化模型[J].计算机与数字工程,2017,45(10):1900-1902,3.基金项目
广东省高职教育一类品牌专业资助项目(编号:2016gzpp007)资助. （编号:2016gzpp007）
