Work Related Knowledge

1.分支限界法

在每次分支后，对凡是界限超出已知可行解值那些子集不再做进一步分支。这样，解的许多子集（即搜索树上的许多结点）就可以不予考虑了，从而缩小了搜索范围。这一过程一直进行到找出可行解为止，该可行解的值不大于任何子集的界限。因此这种算法一般可以求得最优解。

将问题分枝为子问题并对这些子问题定界的步骤称为分枝定界法。

Branch and bound method

After each branch, no further branches are made for those subsets whose boundaries exceed the known feasible solution values. In this way, many subsets of the solution (ie many nodes on the search tree) can be ignored, thus narrowing the search. This process continues until a feasible solution is found, the value of the feasible solution being no more than the bounds of any subset. Therefore, this algorithm can generally find the optimal solution.
The step of branching the problem into sub-problems and delimiting these sub-problems is called the branch and bound method.