在该模型的基础上，利用分枝定界算法求解最大割问题。

Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.

youdao

在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。

In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.

youdao

在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。

In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.

youdao