Suggestion : according to the water cubage of aquarium ( pool ) and max. flux if pump , and the size of tube diameter, cut the pagoda type hose joint to match if.
建议：宝塔式水管接头，可根据水族箱（池）的水容积及水泵最高流量，结合管径大小加以切除配套。
The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。
The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.
把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。
The max-cut problem is a standard NP-hard problem in graph graphic theory.
最大割问题是图论中的一个典型的NP困难问题。
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
In this paper, a quadratic programming algorithm is presented to solve Max-cut problem.
本文给出了最大割问题的二次规划算法。
应用推荐