branch and bound algorithm meaning in English
分枝界定法
分支定界法
Examples
- Methods such as branch and bound algorithm , mixed integer programming , transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm
近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。 - 2 . presenting a modified branch and bound algorithm by adding the heuristic algorithm in the cluster which increasing the efficiency of eliminating node . 3 . the problem ’ s scale is decreased through using distributed parallel computing algorithm
2 .详细研究了几种主要的启发式算法,并使用启发式算法修改了分支定界算法,在保证计算精度的前提下,提高了分支节点的淘汰效率。 - Based on our extensive study of many different scheduling optimizations , we can summarize the results into five scheduling rules . based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model
根据不同生产方式优化调度研究成果得出了五个调度规则，应用这些规则与分枝定界方法分别构造出上、下层调度模型的启发式分枝定界优化算法。 - The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper . based on these existing algorithms , we present a new branch and bound algorithm for the maximum weight clique problem
本文首先对当前国际上最大团问题的理论研究成果及算法研究中的启发式算法进行了介绍，然后对精确算法中的分支定界法作了较为详细的讨论，最后作者在现有算法的基础上，给出了最大加权团问题的一种新的分支定界算法。 - A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed , in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique
摘要构造出了一类可分离非线性0 - 1背包问题的分枝定界算法，分枝的过程是普通的0 - 1变量分枝，用简单的取整启发式法确定更好的可行解；而在每个分枝结点处用线性松弛技术确定了它的子问题的一个线性规划松弛逼近，由此得到最优值的一个下界。