分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
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 discusses the problem of choosing optical cable route with branch and bound way and puts forward the model of planning route in Layered network.
用改进的分枝限界法判认主要失效模式。
The significant failure models are identified by using the modified branch and bound method.
本文给出了逻辑划分问题解集合的树结构以及有关总针数的若干矩阵不等式，建立了一个分枝限界算法。
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.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
应用推荐