摘要
一些NP完全问题已有了在实际应用时值得一试的求解算法.本文通过对分枝定界法的进一步分析,采用这种算法,开展数学建模中最优化问题案例的研究.在求解"指派问题"等NP问题上提出分枝定界法的改良思路.
Some NP-comptete problem has practical applications in the worth of the algorithm. This paper analys Branch-and-bound method further to carry out case studies with Optimization problem in Mathematical modeling. In solving the ＂assignment problem＂, some improvement ideas about B＆B method are proposed.
出处
《邵阳学院学报（自然科学版）》
2009年第4期45-48,共4页
Journal of Shaoyang University：Natural Science Edition
关键词
分枝定界
最优解
线性规划
松弛问题
branch and bound method
optimal solution
linear programming
relaxation problem
