In this thesis, the design and realization of a special cluster are presented for calculating branch and boundalgorithm that can decrease the calculating time and enhance the algorithmic efficiency.
Branch and Boundalgorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法,并行化是提高算法性能的有效手段。
3
Based on the model, we use the Branch-and-Boundalgorithm to solve the max-cut problem.