整数规划下的最小生成树模型

Minimal Spanning Tree Model by Integer Programming

求解最小生成树的方法虽然很多 ,但是利用LINGO建立相应的整数规划模型是一种新的尝试。本文利用树根和节点级数的概念 ,借助于LINGO建立了求解最小生成树的整数规划模型 ,并对模型中的难点给出了详细的注释。

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. [