当切换动态规划（二维表）的分支定界算法？
When to switch from Dynamic Programming (2D table) to Branch & Bound algorithm?
实验表明，基于这些结果所构造的分支定界算法是有效的。
Numerical experiments showed that the branch and bound method with these techniques was effective.
本文介绍了求解凸集上凹函数最优解的一种分支定界方法。
A branch and bound methods is proposed for minimizing concave function over a convex.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。
A general subset selection method, the branch and bound technique, is applied to a control structure selection problem.
本文结合连分数算法，采用分支定界原理提出了一种新的板材分割算法。
In this paper, based on continued fractions algorithm and branching-bounding algorithm, a new algorithm applied in cutting a long rectangular sheet into several sections is put forward.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。
Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。
In this paper, a new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
This paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。
At the same time, the branch-and-bound algorithm and greedy algorithm are developed to solve the model, and a numerical example is given to illustrate and test the algorithms.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
通过分支定界法对小规模算例的验证表明，本遗传算法获得精确解的比例是高的，由此认为所给遗传算法是很有效的。
The proposed GA algorithm is verified effective by comparing with the Branch and Bound method on small sized numerical experiments.
本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
根据问题的最优性和可行性提出一新的区域删除准则以排除问题（P）的可行域中不存在全局最优解的部分，结合区域删除准则和分支定界理论给出新算法。
New region-deleting principles are proposed based on the optimality and feasibility of the problem so as to delete the subregion without containing the optimal solutions of the problem(P).
“分支”为整数规划最优解的出现创造了条件，而“定界”则可以提高搜索的效率。
"Branching step" has created the condition for the integer linear programming appearance, but "bounding step" may enhance the search the efficiency.
“分支”为整数规划最优解的出现创造了条件，而“定界”则可以提高搜索的效率。
"Branching step" has created the condition for the integer linear programming appearance, but "bounding step" may enhance the search the efficiency.
应用推荐