Optimization Model For Communications Node Connection Problem
GUI Gaihua
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.
Keywords：minimum spanning treeKruskal algorithmexhaustive method0-1 programming
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：3( 1900-1902 )