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.
本文首先对现有求解网络最大流的各种算法进行了分析和比较。
To solve the problem of calculate maximum power in power system restoration process, the paper proposes the method of combined of flow calculation and sensitivity.
针对电力系统恢复过程中最大功率计算问题，提出了将潮流计算和灵敏度分析相结合的方法。
This article discusses the inverse generalized upper bounding problem and generalized maximum flow problems.
本文研究了广义上界问题的反问题及广义最大流问题的反问题。
How to guarantee the maximum capacity of traffic flow and minimum of traffic delays based on expo vehicles passed smoothly is the most significant problem.
如何在世博专线车顺利通行的条件下保证车流最大通行能力和最小车流延误，是采取交通措施的最大难题。
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 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...
该算法能求得问题的最优解，并具有易于编程实现、收敛性好等优点，大量数值实验表明该算法非常实用有效。
应用推荐