摘要
分枝限界算法是一种求解组合优化问题的一般性方法,并行化是提高算法性能的有效手段。文章使用[5]中提出的算法模式和结构模式的概念和思想设计并实现了一个并行分枝限界算法的产生器。该产生器通过提供并行分枝限界算法的抽象框架,将它应用于要求解的问题,可以得到问题的并行分枝限界算法。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Paral- lelization is an effective means to improve the algorithm performance. Using the algorithm patterns and architecture patterns we proposed in [5],we design and implement a parallel Branch and Bound algorithm generator. The generator describes the abstract framework of parallel Branch and Bound algorithm. While applying it to a concrete problem,a parallel Branch and Bound algorithm for solving the problem will be generated.
出处
《计算机工程与应用》
CSCD
北大核心
2001年第9期23-26,共4页
Computer Engineering and Applications
基金
国家自然科学基金资助!(编号:69983003)