in the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中,剖分区间的选取直接影响到整个算法的收敛速度。
based on its mathematical programming modeling, the branch and bound algorithm is presented.
基于mvrp的数学规划模型,提出了它的分枝定界算法;
a procedure for judging the existence of feasible solution is proposed. in the branch and bound algorithm, the forward search strategy is adopted, a modified bound …
在分枝定界数值算法中,采用了前向搜索策略,提出了定界算法,讨论了重复解的消除方法,并用示例说明了算法在减小搜索空间上的有效性。
in this paper a new exact algorithm is proposed for solving project scheduling problems under multiple resource constrains which is based on the branch and bound procedure.
基于分支定界法的思想提出了一种新的精确求解多资源约束下项目进度规划问题的最优化算法。
the paper takes the branch and bound algorithm for example and introduces the design philosophy and practical steps of the process.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
the proposed ga algorithm is verified effective by comparing with the branch and bound method on small sized numerical experiments.
通过分支定界法对小规模算例的验证表明,本遗传算法获得精确解的比例是高的,由此认为所给遗传算法是很有效的。
the two upper bound「s improvement methods are proposed to increase the branch and bound algorithms」 efficiency: (1) modified initial upper bound;
为了提高分支定界算法的效率,提出了两种改进上界的策略:(1)改进初始上界法;
in this paper, a model for productive managing planning in factory is constructed and is solved by the simplex method with the branch and bound method of goal programming.
本文用混合整数目标规划建立了工厂(企业)的生产(经营)计划模型,并将目标单纯形法和分枝定界法相结合给出了一个算法。
a general subset selection method, the branch and bound technique, is applied to a control structure selection problem.
一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。