| 整数规划下的最小生成树模型 |
| |
| 引用本文： | 洪文,朱广斌. 整数规划下的最小生成树模型[J]. 安徽电气工程职业技术学院学报, 2004, 9(1): 96-100 |
| |
| 作者姓名： | 洪文 朱广斌 |
| |
| 作者单位： | 安徽大学,安徽,合肥,230039;安徽电气工程职业技术学院,安徽,合肥,230022 |
| |
| 摘 要： | 求解最小生成树的方法虽然很多 ,但是利用LINGO建立相应的整数规划模型是一种新的尝试。本文利用树根和节点级数的概念 ,借助于LINGO建立了求解最小生成树的整数规划模型 ,并对模型中的难点给出了详细的注释。最后讨论了该模型的一些实际应用
|
| 关 键 词： | 树 最小生成树 整数规划 LINGO语言 |
| 文章编号： | 1009-1238(2004)01-0096-05 |
| 修稿时间： | 2003-10-21 |
Minimal Spanning Tree Model by Integer Programming |
| |
| HONG Wen ,ZHU Guang-bin. Minimal Spanning Tree Model by Integer Programming[J]. Journal of Anhui Electrical Engineering Professional Technique College, 2004, 9(1): 96-100 |
| |
| Authors: | HONG Wen ZHU Guang-bin |
| |
| Affiliation: | HONG Wen 1,ZHU Guang-bin 2 |
| |
| Abstract: | Although there are many methods about solving MST question, at first it is solved by integer programming model of LINGO. The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. There are particular notes to the difficulties of the model. Finally it was mentioned that the discussion about some application of the model. [ |
| |
| Keywords: | tree minimal spanning tree integer programming LINGO language |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
