分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
This paper presents the tree structure of the solution set for logic partitioning problem and some matrix inequalities relating to the total amount of pins.
应用推荐