查询词典 branch and bound method

Corresponding to such a NP-hard problem, this paper gives some polynomial time solvable cases, and a branch and bound algorithm with a rapid method for estimating the lower bound for general case.

对这一NP-困难的排序问题，文中给出了几个多项式可解的特殊情形，一般情况下的一个快速下界估计方法以及相应的分支定界算法。

Although departed methods such as dynamic programming, integer programming, and branch bound method can solve small scale problems, the rise in execution time of these methods is exponential with the number of generating units.

虽然在以往的研究中，已有许多方法使用在此问题上，例如动态规划法、整数规划法及支界法等，但是由於这些方法所需的求解时间会随机组数的增加呈指数关系成长，因此都比较适合於小规模系统上使用。

Applying the De Caen"s inequality of sum of the squares of the degree and Cauchy"s inequality, we obtain a strict lower bound and a strict upper bound of the largest Laplace eigenvalues only in terms of vertex number of a unicycle graph. Applying the Laplace matrix theorem of trees, we obtain an upper bound of the second smallest Laplace eigenvalues of a unicycle. Extremal graph whose second smallest Laplace eigenvalues reach the obtained upper bound is determined. We also obtain an upper bound of the second largest Laplace eigenvalues in terms of vertex number of the largest connected branch of unicycle graph, and obtain a theoretical method to calculate the second largest Laplace eigenvalues of unicycle graph. We obtain an upper bound of any Laplace eigenvalues in terms of vertex number of a unicycle graph. We also obtain the distribution of Laplace eigenvalues in the inter [0,n] in terms of the matching number.

本文得到了以下几个方面的结果： 1、利用图度平方和的De Caen不等式和Cauchy不等式给出单圈图的最大Laplace特征值仅依赖于顶点数的严格的上下界；利用树的Laplace理论给出了单圈图次小Laplace特征值的一个上界，并刻画了达到该上界的极图；利用子图的连通分支的顶点个数给出了单圈图次大Laplace特征值的一个上界，并给出了单圈图次大Laplace特征值一个理论上的一个求法；利用单圈图的阶数给出了其一般Laplace特征值的一个上界；利用单圈图的匹配数给出其Laplace矩阵谱在区间[0，n]上的分布情况。

With the sin-gle objective situation,the complexity for them is discussedat first.Then a directed and an indirected search method isdesigned for two respect BDMPs with O-1 variables byusing branch and bound technique.

对于单目标型的两层决策问题，文章在分析了求解这类问题的复杂性的基础上，利用分枝定界技术，对两类特殊的含0—1变量两层决策问题提出了间接式求解方法和直接式求解方法。

In this paper,a quadratic programming method based on semidefinite programming is given to solve the design of FIR filters with discrete coefficients in the light of literature 6,which can give a better bound than a semidefinite programming relaxation method.Based on the model,the Branch-and-Bound algorithm is used to solve this problem.

基于离散系数滤波器设计问题已有的半定规划松弛模型，利用文献[6]的方法给出了该问题的二次规划松弛模型，该模型能给出比半定规划模型更好的界，然后运用分支定界方法求解该模型。

However, as the name（read－only memory）implies, CD disks cannot be written onorchanged in any way.

然而，正如其名字所指出的那样，CD盘不能写，也不能用任何方式改变其内容。

Galvanizes steel pallet is mainly export which suits standard packing of European Union, the North America. galvanizes steel pallet is suitable to heavy rack. Pallet surface can design plate type, corrugated and the gap form, satisfies the different requirements.

镀锌钢托盘多用于出口，替代木托盘，免薰蒸，符合欧盟、北美各国对出口货物包装材料的法令要求；喷涂钢托盘适用于重载上货架之用，托盘表面根据需要制作成平板状、波纹状及间隔形式，满足不同的使用要求。