Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Parallelization is an effective means to improve the algorithm performance.

• 分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。