介绍了最大流问题的多解，提出了通过调整圈来求解最小费用最大流的方法。

This paper introduce multiple solutions to maximal flows and, by adjusting circle, presents a simple approach to work out maximal flows at lowest cost.

youdao

对运量有上界的转运问题进行研究，给出了求解此类问题的两种求解算法：表上作业法和最小费用最大流法。

Two methods of the minimum expenses and maximum flux and the table dispatching method to the rotating-transporting problem with a transport amounts upper bound were given.

youdao

我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。

Constructing a simple network and converting the allocation problem into the min-cost max-flow in the network, we have developed an optimal algorithm for the allocation problem.

youdao