【摘要】 本文给出了一种求解运输问题的算法——最小生成树算法，采用树状数据结构存 储基本可行解．采甲二叉树遍历算法求位势．沿逆向指针找出闭回路，占用存储空间 少、运算速度快。文中对该算法与已有的一些求解运输问题的位势法作了分析比较。 文中还指出：若对此算法所采用的数据结构和实现的运算适当地加以修改便可应用于 求解一般的网络规划问题．更多还原

【Abstract】 A minimum spanning tree algorithm is presented for solving the transportat- ion problem. The tree structure is used to store the basic feasible solution, so the simplex multiplies can be solved by using the binary tree traversable,algor- ithm and the circuit can be found by tracing the back pointer. The comparison is made between the algorithm presented in this paper and some other algorithms based on the transportation simplex method, and it is pointed out that the former reduces computer memory requirement and program run time. It is also pointed out that if the data structure and the operation given in the paper are properly modified, they also can be used to solve the network programming problems.更多还原