分枝限界法的实现及改进方案

IMPLEMENTATION OF BRANCH AND BOUND ALGORITHM AND IT'S AMELIORATIVE SCHEME

分枝限界算法是一种组合搜索的常用方法 ,本文以具体实例介绍了该方法的基本原理 ,并对其加以改进 ,使该算法的效率得到提高。

Branch and Bound Algorithm is a general method to solve combination searching problem.This paper introduced the main principle of this method by an instance,then ameliorate the arithmetic to improve it's efficiency.