The Application Of Branch And Bound Algorithm In The Model Of Operational Research

The integer programming is a kind of special plan question, The integer programming forms the independent branch from 1958 and then was proposed the cutting plane algorithm after R.E. spear Mowry, 50 for many years has developed many methods to solve each kind of problem. Not only it relatively simple, but also it is quite mature in the theory and the algorithm, also it has the widespread application in the actual problem. As a result in management, economical as well as in industrial production optimized model widespread application, therefore the integer programming is taking on the very important role in the optimized theory.As early as in the 1960s the branch and bound algorithm which by Land Doig and Dakin et al. proposed is quoted by its unique algorithm strategy by the people. Its algorithm is not only suitable for expressing the integer linear programming (or mix integer linear programming) the question, but it is also suitable for nearly any combination optimization question. Although the integer programming question is NP difficult, the linear question actually has the efficient algorithm, The branch and bound algorithm exactly uses this point.The paper research content is as follows:Firstly the paper analyzes, summarizes the development process of optimization theory, optimization algorithm and introduces a special kind of optimization algorithm—branch and bound algorithm;Next made the improvement according to the branch and bound algorithm's thought principle to the algorithm to accelerate the algorithm astringency, After and will improved algorithm applies in the solution of one dimensional cutting stock problem, Through carries on the comparison with other algorithms, This algorithm raised raw material use greatly;Then based on the determined algorithm is applied to solve knapsack problem, The experiment indicated that this algorithm simplifies the solution process, reduces the computation complexity effectively;After then through the matrix redundant search in the assignment problem, It applies to the assignment problem, This is the algorithm's application promotion. The experiment indicated that applies this algorithm solution assignment problem is feasible;Finally it was the summary to this article worked and the questions which still needed to further discuss.