针对上述问题展开讨论，并对一些最大流算法进行改进。
Discuss these questions, and do some improvement of the existing algorithms.
针对目前网络最大流算法存在的问题，研究一种适应性更广的新算法。
Abstract Concerning the problems in flow algorithm on network, a new algorithm with strong applicability was studied.
传统最大流算法虽然能较好的解决主题漂移问题，但对社区的质量和数量也会带来许多不利的影响。
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.
在此基础上以运输成本最小化为二级目标建立模型，将其转化成带有分层的网络流模型，用最小费用最大流算法进行求解。
On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimum cost maximum flow algorithm.
本文首先对现有求解网络最大流的各种算法进行了分析和比较。
To begin with, this paper analyzed and compared kinds of methods solving the network maximum flow problem.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
我们构造了一个简单网络，将布点问题转化为该网络中的最小费用最大流问题，从而给出了求解布点问题的最优性算法。
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.
对运量有上界的转运问题进行研究，给出了求解此类问题的两种求解算法：表上作业法和最小费用最大流法。
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.
由于改进算法涉及到了最大流问题方面的内容，本文也对社区发现中基于最大流的社区发现方法及标号算法进行了讨论。
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.
而使用新方法可以得到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.
网络最大流与最小割集的矩阵算法，不仅能解决许多这类问题，而且能使最小费用流、分配问题和运输问题容易通过计算机来实现。
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.
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the application of algorithm in the network of road.
算法将上述非线性问题转化为多个最大流问题求解，并为求解非线性可分凸费用网络流问题提出了通用的求解框架。
This algorithm translates the process of solving NNFPCSC into solving of many maximum flow problems, and provides a general frame for solving NNFPCSC.
首先对给定的数据流图进行单电压高层次综合，然后对单电压综合结果迭代地进行多电压调整；提取每次迭代时需要调整的网络流子图，对该子图运行最小费用最大流增量算法。
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
提出了计算塑料制件最大流长比(流动长度与厚度的比值)的算法。
A new algorithm is proposed for calculating the maximum flow length ratio of plastic product.
给出了两种情况下的算法与程序框图：（1）最大流量状态（适用于最快装运与调转）；
Algorithms and flow-charts of computer programs are given for the following operation states: (1) maximum flow state;
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the …
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the …
应用推荐