查询词典 Bound

Smallest circle with a branch and bound method!

最小圆排列的分支限界法！

Regarding a sequence closely related linear_programming problems to be sloved, an algorithm based on a branch and bound method is given.

针对这个特点，提出了应急限制期下的应急选址模型，并提出了基于分支定界方法的应急选址模型的最优解。

Magnetic Resonance Imaging, Integer Programming, Branch and Bound Method, Shimming

磁共振成像；整数规划；分支定界法；匀场

Reverse logistics ; recycling ; mixed integer linear programming ; branch and bound method

反向物流；再循环；混合整数线性规划；分枝定界法

The construction of traditional models for batch scheduling relies on the definition of time slots or time events.which lead to the result that many binary variables are involved in the models and it takes much time to solve the problems with the 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.

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

At first the typical die and mould components and their standard processing technique,and the types of facilities were defined.Then the integer programming model of the facility planning was established and the branch and bound method was used to give a solution to the model cases.

定义了模具典型零件、设备类及模具典型零件标准工艺；建立了设备资源规划的整数规划数学模型；采用分枝—定界法对给定实例进行求解；计算结果证明了模型的有效性及实用性。

Moreover object convergence approach also may with cutting plane method, branch and Bound Method and so on the method unify the use, thus acceleration solution process.

而且目标收敛法还可与割平面法、分枝估界等方法结合起来使用，从而加速求解过程。

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根据最优解的性质给出了遗传算法和分支定界法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。