Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
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.
本文研究了具有惩罚因子的合同加工排序问题，提出了相应的分枝定界算法。
应用推荐