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困难问题。
应用推荐