...问题;分枝定界求解算法;内存优化管理 [gap=840]Key words】large-scale integer programming problem; branch & bound algorithm; memory optimizing management ...
基于8个网页-相关网页
在该模型的基础上，利用分枝定界算法求解最大割问题。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
应用推荐