解运输问题的Flood方法

Flood's Way for Solving Transportation Problem

文献[3]证明运输问题可化为分配问题,并把解分配问题的 Flood 方法推广于运输问题,但没有给出次数最小盖零直线集合的具体方法。本文给这种直线集一个表上作业法,使解法程序化,比之用网络的算法简单。其运算大约为 O(N^2L),N=nm。

This paper proved that the transportation problem can be simplified into distribution problem,and expand the distribution problem Flood method into transportation problem,but it didn't give the concrete methed for minimum degree covering O-line set.This paper gave an operation for the table of the line set,and made it possible to program,it'smueh simpler than the network method.The operation is approximately O(N^2L),N=nm,L=∑f_i.