查询词典 branch and bound method

In order to implement nonlinear predictive control for the controlled plant, a T-S fuzzy predictive model is built on-line by using fuzzy clustering and linear identification, and discrete optimization of the control action is carried out according to the principle of Branch and Bound method.

算法由两部分组成：第一部分采用模糊聚类和线性辨识方法在线建立系统的T-S模糊预测模型；第二部分基于分支定界法的基本原理对控制量进行离散寻优，从而实现对象的非线性预测控制。

Secondly, the research methods of the pallet loading problem are induced. Branch and Bound Method is analysed. Upper bounds for the Pallet Loading Problem are summerizaed.

接着，归纳了装盘问题的研究方法，分析了分支定界方法，重点总结了装盘问题中的定界算法。

We study the optimal properties of the problem 1 |p_j=a or a+b_j, d |∑w_jC_j and according to it a kind of GA implement and a kind of Branch and Bound method are given.

本章考虑了单机分段恶化排序问题1| p_j= a or a+b_j， d |∑w_jC_j根据最优解的性质给出了遗传算法和分支定界法。

For the above problem, two heuristic methods and a hybrid optimal algorithm that incorporates the branch and bound method with active schedule constru〓n algorithm are presented Computational results show the effectiveness of these methods.

对上述问题，给出了两个启发式方法和一个将分支定界法和活动调度构造算法相结合的混合最优算法。

When problem scale is small, we can adopt many classical algorithms such as linear programming integer programming, branch and bound method to solve this problem.

当问题规模较小时，可用线性规划、整数规划、动态规划等经典算法求解。

Moreover, if the optimization problem has certain special feature, the simpler relaxation methods can be provided. For example, considering a generalized geometric programming problem, relevant relaxation linear programming can be obtained using its special structure. Based on the branch and bound method, a linear relaxation algorithm of global optimization is presented for generalized geometric programming, and the convergence of the algorithm is also proven.

此外，当优化问题具有某种特殊性质时，我们能给出更加简便的松弛化方法，如考虑广义几何规划问题，能充分利用其特殊结构，建立了广义几何规划问题的松弛线性规划问题；在分枝定界技术的基础上，提出了一个求广义几何规划全局解的线性松弛算法；证明了算法的收敛性。

The given Branch and Bound method can find out the optimal solution of the problem in small size while the given GA implement can quickly find out the approximate optimal solution of the problem in large size. The given GA implement proves to be very effective by numerical experiments and examples.

对于问题的较小规模情形分支定界法能精确地求得最优解；对于问题的较大规模情形遗传算法能很快地求得近似最优解；算例及大量实验表明用遗传算法来求问题的近似解是成功的。

By means of Heuristic Search, Branch and Bound method and Voronoi Diagram, the algorithm analyzes occlusion on complicated denture models precisely and quickly, which solved the practical problem in the application of VR technologies in dentistry.

通过推广基于分离轴定理的经典碰撞检测算法，借助启发式搜索、分支定界和Voronoi图等手段，算法可以在较短的时间内对复杂牙列模型完成高精度的定量咬合分析任务，解决了虚拟现实技术在口腔医学领域应用中的实际问题。

An advanced branch and bound method which reduces the computer resolving time enormously and leads the reliability research of large-scale spatial frame structural systems close to practical use is presented on condition that the same computation accuracy is ensured.

导出了大型空间刚架结构系统某梁元断面达到塑性屈服极限时的修正刚度矩阵和相应的等效节点力向量；提出了在保证同等计算精度的条件下，可成倍地减少运算时间的改进分枝限界方法，使大型空间刚架结构系统的可靠性研究向实用化迈进；本文开发出可自动生成失效衡准，自动选择主要失效形式，追踪失效过程的计算机程序。

With the aim at deriving optimal solutions, branch-and-bound method is one of the most well adopted implicit enumerative approaches.

为达成获得最佳解的目标，分支界定法是最常采用的列举法之一。

I didn't watch TV last night, because it .

昨晚我没有看电视，因为电视机坏了。

Since this year, in a lot of villages of Beijing, TV of elevator liquid crystal was removed.

今年以来，在北京的很多小区里，电梯液晶电视被撤了下来。