最大流问题是一个经典的组合优化问题。
The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一类经典的组合优化问题。
The maximum flow problem is a classical combinatorial optimization problem.
本文研究了广义上界问题的反问题及广义最大流问题的反问题。
This article discusses the inverse generalized upper bounding problem and generalized maximum flow problems.
介绍了最大流问题的多解，提出了通过调整圈来求解最小费用最大流的方法。
This paper introduce multiple solutions to maximal flows and, by adjusting circle, presents a simple approach to work out maximal flows at lowest cost.
容迟网络中的最大流问题被转化为静态网络中的问题，从而可用最大流方案进行求解。
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.
本文对网络中最大流问题的求法进行了探索。利用画树图，给出了网络最大流的生长树求法。
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.
针对最大流问题的研究现状，提出了分层求解最大流的简单方法，并给出了该方法可行的严格证明。
In order to solve the problem of maximum flows, a new feasibility approach was proposed according to the present research situation.
由于后者的实用性更强，人们对它投入的关注与研究也更多，因而实际中是通过最大流问题来求最小割集问题。
People pay mo re attention to and plunge more research into the latter because of its more practical use, and thus always solve the minimum cut problem by means of the maxim um flow algorithm.
算法将上述非线性问题转化为多个最大流问题求解，并为求解非线性可分凸费用网络流问题提出了通用的求解框架。
This algorithm translates the process of solving NNFPCSC into solving of many maximum flow problems, and provides a general frame for solving NNFPCSC.
由于改进算法涉及到了最大流问题方面的内容，本文也对社区发现中基于最大流的社区发现方法及标号算法进行了讨论。
Because the improved algorithm involves the knowledge of the maximal flow problem, this paper also addressed discovering community method based on maximal flow and the symbol algorithm.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
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.
而使用新方法可以得到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.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
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.
建立了求解铁路局范围内请求车审批优化的数学模型和与此模型对应的网络图，将铁路请求车审批优化问题转换为求解最小费用最大流问题。
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.
对运量有上界的转运问题进行研究，给出了求解此类问题的两种求解算法：表上作业法和最小费用最大流法。
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.
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
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.
针对目前网络最大流算法存在的问题，研究一种适应性更广的新算法。
Abstract Concerning the problems in flow algorithm on network, a new algorithm with strong applicability was studied.
回顾人们对生命本质问题的认识历程，依据一个新的物理学原理(最大流原理)，尝试给出生命的新定义。
Based on a new physical principle-Maximum Flux principle, we then have made an effort to give a new tentative definition on life.
传统最大流算法虽然能较好的解决主题漂移问题，但对社区的质量和数量也会带来许多不利的影响。
Although the subject drifting problem can be well solved by the traditional maximum-flow algorithm, but it will also bring a lot of disadvantage influences to the community's quality and quantity.
针对上述问题展开讨论，并对一些最大流算法进行改进。
Discuss these questions, and do some improvement of the existing algorithms.
针对网络最大流的计算问题，提出了一种网络最大流计算模型的实现方法。
On the algorithm of the network maximal flow, the paper provides a method of achieving it.
针对网络最大流的计算问题，提出了一种网络最大流计算模型的实现方法。
On the algorithm of the network maximal flow, the paper provides a method of achieving it.
应用推荐