查询词典 bound for

To develop a branch and bound method for this problem,a nonlinear integer-programming model was constructed.

为设计求解该问题的分支定界算法，建立了非线性整数规划模型。

Solutions using Matlab branch and bound method for integer programming proc...

matlab解用分支定界法解整数规划的程序。

Solutions using Matlab branch and bound method for integer programming procedures.

matlab解用分支定界法解整数规划的程序。

1 Knapsack problem is a classical algorithm for the problem, there are several solution here solved with branch and bound method.

详细说明：0-1背包问题是一个经典的算法问题，有多种解法，这里用分支定界法求解。

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.

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

The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.

全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。

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.

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

Second, according to model characteristic, such as non-linear, non-convex, multiple-peaked and so on, the paper discusses limitation of traditional solving algorithm, such as branch and bound method, GBD method and OA method, puts forward penalty function-makeup integer algorithm and genetic algorithm, analyses procedures of genetic algorithm, such as selection, crossover and mutation, brings forward modifications for specific realized problems of genetic algorithm, such as selection of initial points, operator design, adoptive value adjustment, constraint treatment and so on, and works out correlated solving program.

其次针对该模型非线性、非凸、多峰等特点，讨论了分支定界法、GBD法和OA法等传统求解算法的局限性，提出了罚函数一凑整算法和遗传算法的求解思路，对遗传算法的选择、交叉、变异等过程进行分析，对遗传算法初始点选择、算子设计、适应值调整和约束处理等具体实现问题提出了改进措施，并编制了相关的求解程序。

Singer Leona Lewis and former Led Zeppelin guitarist Jimmy Page emerged as the bus transformed into a grass-covered carnival float, and the pair combined for a rendition of "Whole Lotta Love".

歌手leona刘易斯和前率领的飞艇的吉他手吉米页出现巴士转化为基层所涵盖的嘉年华花车，和一双合并为一移交&整个lotta爱&。

This is Kate, and that's Erin.

这是凯特，那个是爱朗。