分枝-限界(Branch & Bound) 计算机科学与技术学院 主要内容 引论 主要思想 求解步骤 应用 作业调度问题(Job Scheduling) 旅行商问题(TSP...
基于6个网页-相关网页
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
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.
应用推荐