分支限界算法的研究与实现

摘要

The algorithm of branch and bound is a solution to search problems in the tree of solution space, whose main solution is breadth-first search (BFS) or the least cost first, and the central idea is "pruning". The general strategy and implementation steps of the branch and bound algorithm are proposed. Taking the wiring problem of circuit board as an example,whose algorithm is designed and implemented. The efficiency of the branch and bound algorithm is verified through experimental data, and its high performance is showed.%分支限界算法是一种在问题的解空间树上搜索问题的解的方法,主要采用广度优先或最小耗费优先的方法搜索解空间树,其核心思想就是"剪枝".首先提出了分支限界算法的一般策略与实施步骤,然后以电路板布线问题为实例,设计并实现该问题的算法,经过实验数据验证了其性能,进而反映了分支限界算法的高效性.