运输最短时限问题的网络解法及讨论

A Network Algorithm of the Transportation Problem of the Shortest Time Limit and Its Additional Information

本文提出了运输最短时限问题的基于Ford-Fullerson最大流算法的网络解法,并讨论了这个算法给出的附加信息的意义和应用价值,特别是可据以解决"运输某给定量至少需费时多少"的问题。

The paper introduces a network algorithm of the transportation problem of the shortest time limit which bases on the Ford-Fullerson algorithm, and therefore points out the meanings of its additional information and its application value in business, especially in the problem of the minimum time needed to transport a given goods.