The Maximum Flow Problem 最大流问题
generalized maximum flow problem 广义最大流问题
maximum flow problem of networks 网络最大流问题
minimum cost maximum flow problem 最小费用最大流问题
minimum-cost maximum flow problem 最小费用最大流问题
The maximum flow problem is a classical combinatorial optimization problem.
最大流问题是一类经典的组合优化问题。
The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
To begin with, this paper analyzed and compared kinds of methods solving the network maximum flow problem.
本文首先对现有求解网络最大流的各种算法进行了分析和比较。
应用推荐