The Maximum Flow Problem的意思|示意

To begin with, this paper analyzed and compared kinds of methods solving the network maximum flow problem.

本文首先对现有求解网络最大流的各种算法进行了分析和比较。

The maximum flow problem is one of the classical combinatorial optimization problems.

最大流问题是一个经典的组合优化问题。

This article discusses the inverse generalized upper bounding problem and generalized maximum flow problems.

本文研究了广义上界问题的反问题及广义最大流问题的反问题。

The algorithm, which can find the optimal solution to the maximum profit flow problem, has the merits to be programmed easily and of good convergence, and many numeric...

该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。

The maximum flow problem is a classical combinatorial optimization problem.

最大流问题是一类经典的组合优化问题。

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.

传统最大流算法虽然能较好的解决主题漂移问题，但对社区的质量和数量也会带来许多不利的影响。