分支定界法 meaning in English
branch and bound algorithm
Examples
- To improve the efficiency of the branch and bound technique , some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability
同时，为提高分支定界法的效率，利用启发式规则剪去产生最优解可能性很小的分支。 - In addition , in consideration of the non - convex and non - concave nature of the combinational optimization sub - problem , the branch and bound technique is adopted to obtain or approximate the global optimal solution
针对组合优化子问题的非凸非凹性，采用分支定界法，以求得或接近全局最优解。 - 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
近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。 - 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
本文首先对当前国际上最大团问题的理论研究成果及算法研究中的启发式算法进行了介绍，然后对精确算法中的分支定界法作了较为详细的讨论，最后作者在现有算法的基础上，给出了最大加权团问题的一种新的分支定界算法。