Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。
Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
并通过理论分析提出一种启发式与分枝定界相结合的算法。
This paper first presents a branch-and-bound algorithm to minimize a finite sum of stair-case functions under linear constraints.
该文首先给出了求在线性约束下极小化有限个阶梯函数和的一种分枝定界算法。
应用推荐