·2,447,543篇论文数据，部分数据来源于NoteExpress
在该模型的基础上，利用分枝定界算法求解最大割问题。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
本文研究了资源有限—工期最短的优化问题，提出了相应的分枝定界算法。
In this pater, the problem of limited resources and shortest time limit for a project is studied and an algorithm of branch and bound method for this problem is proposed.
本文研究了具有惩罚因子的合同加工排序问题，提出了相应的分枝定界算法。
In this paper, the problem for contract processing sequencing with penalty factor is studied and a branch and bound method for this problem is proposed.
应用推荐