摘要
研究了图与网络领域中的一类经典问题——最小支撑树问题,分析其现有算法的不足,通过引入0-1变量和辅助变量,根据最小支撑树的本质属性,从两个角度建立了最小支撑树问题的整数规划模型,编写了与模型相对应的LINGO程序。实证分析验证了模型的正确性,比较了两种建模模式的优劣。
The classical problem in the area of graph and network-the minimum spanning tree problem was studied and the shortcomings of its existing algorithm were analyzed.By introducing 0-1 variables and auxiliary variables and deploying the essential properties of the minimum spanning tree,the integer program model for the minimum spanning tree problem from two angles was formulated,and the LINGO program corresponding to the model was written.The correctness of the model was verified in empirical analysis,and the advantages and disadvantages of the two models were revealed.
作者
王继强
WANG Ji-qiang(School of Mathematics and Quantitative Economics,Shandong University of Finance and Economics,Jinan 250014,China)
出处
《科学技术与工程》
北大核心
2021年第12期4995-4998,共4页
Science Technology and Engineering
基金
国家自然科学基金(61502151)
教育部产学合作协同育人项目(201802047030)。
