网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
Matrix arithmetic of network maximal flux and minimal separate set not only solves these problems, but also solves some other problems by the computer such as minimal fee, distribution and transport.
而使用新方法可以得到NC算法，且可以证明节点和边都有容量的有向平面网络中的最小截、最大流问题都是属于NC的。
It is proved that the minimum cut and maximum flow problems in directed planar networks with both node and edge capacities are both in NC.
针对目前网络最大流算法存在的问题，研究一种适应性更广的新算法。
Abstract Concerning the problems in flow algorithm on network, a new algorithm with strong applicability was studied.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
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.
本文对网络中最大流问题的求法进行了探索。利用画树图，给出了网络最大流的生长树求法。
The research is made in this article on evaluation of maximal flow in network, giving the growth tree evaluation on maximal flow of network by drawing the tree map.
算法将上述非线性问题转化为多个最大流问题求解，并为求解非线性可分凸费用网络流问题提出了通用的求解框架。
This algorithm translates the process of solving NNFPCSC into solving of many maximum flow problems, and provides a general frame for solving NNFPCSC.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
We study uncapacitated version of the minimum cost flow problem of one-commodity and two-commodity with not only fixed cost but also variable cost, and give them each a polynomial algorithm.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
This paper discusses the smallest cost problem on the undirection network, which has the upper limit of rate of flow, and sets up its mathematics model, and gives its relevant algorithm.
针对网络最大流的计算问题，提出了一种网络最大流计算模型的实现方法。
On the algorithm of the network maximal flow, the paper provides a method of achieving it.
容迟网络中的最大流问题被转化为静态网络中的问题，从而可用最大流方案进行求解。
With the method, a Delay-tolerant Network(DTN) max flow problem can be easily converted to a static network problem, and be solved by traditional algorithms.
容迟网络中的最大流问题被转化为静态网络中的问题，从而可用最大流方案进行求解。
With the method, a Delay-tolerant Network(DTN) max flow problem can be easily converted to a static network problem, and be solved by traditional algorithms.
应用推荐