Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
2
Numerical experiments showed that the branch and boundmethod with these techniques was effective.
实验表明，基于这些结果所构造的分支定界算法是有效的。
3
The model is based on "BranchBound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.