An Explicit Integer Programming Model of the Minimal Spanning Tree Problem for Digraphs with Asymmetric Weights  

作　　者：Feng Junwen(Naming University of Science and Technology, 210094, P. R. China) 

出　　处：《Journal of Systems Engineering and Electronics》1998年第2期70-81,共12页系统工程与电子技术（英文版）

摘　　要：As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.

关 键 词：Minimal spanning tree DIGRAPH Integer programming Asymmetric weight Stochastic spanning tree 

分 类 号：O221[理学—运筹学与控制论]