查询词典 branch and bound method

We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.

本文考虑此类问题中的如下一个新问题：一个企业的专用网即Intranet网，在因特网上有两种功能。

To speed up the solution of the problem, a solution method that hybridizes heuristic algorithm with conventional branch and bound method is presented.

文中还讨论了采用启发式算法同传统的分枝定界法相结合以提高问题的求解速度，并给出了一个数值例子。

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.

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

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完全问题；第三部分讲述并行计算模型和并行算法设计技术。

In this paper according to the principle of pre run time schedule,we propose a method of how to abstract a real system to the schedule module;how to find a valid solution or optimal solution by using branch and bound method and how to realize it in computer finally.

本文根据预调度原理提出了如何将现实系统抽象成调度模型；如何利用分支限界算法找到可行解或优化解以及如何在计算机上实现它，最后用测试实例验证了它的可行

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法等传统求解算法的局限性，提出了罚函数一凑整算法和遗传算法的求解思路，对遗传算法的选择、交叉、变异等过程进行分析，对遗传算法初始点选择、算子设计、适应值调整和约束处理等具体实现问题提出了改进措施，并编制了相关的求解程序。

The first model is the optimization problems with s linear objective function subject to a system of fuzzy relation equations and a system of fuzzy relation inequalities, which are solved by using path method and 0-1 integer programming with branch and bound method.

第一种为约束为模糊关系方程和模糊关系不等式的具有线性目标函数的优化问题，采用路径法及0-1整数规划中的分枝定界法对其求解；第二种为约束为模糊关系方程和模糊关系不等式的格线性规划问题，采用直接法、路径法及0-1整数规划法对其求解；第三种为模糊关系不等式为模糊的，即约束中有一个可接受的容差，采用容差法及正负理想法对其求解；第四种是一种新的可能性模糊线性规划问题，采用模糊数大小比较法、"切片-粘贴"法及正负理想法，并设计了随机模拟的遗传算法对其求解；第五种为期望值模型，利用期望值将其转化为清晰约束系数的线性规划问题的方法。

The imprecise polynomial circuit optimization is based on arithmetic transformation method, considering the fixed point and floating point representation condition first, then give a realization of circuits under different accuracy boundary, trade off error with power dissipation and area, applying branch and bound method to find the solution with minimal cost, determine the minimal word length which satisfies the error bound, make use of the automation synthesis approach to get ultimate optimize structure at the same time.

非精确多项式电路优化基于算术变换方法，首先考虑电路的定点和浮点表示情况，给出电路在不同精度界限下的实现，进行误差和功耗、面积的权衡，然后应用分枝定界方法求解出最小代价电路，决定满足误差要求的最小字长，同时利用自动综合优化方法得到最终的优化结构。

One is tradition algorithm,which consists branch and bound method,improving loop method,cupidity algorithm,MST algorithm,MM algorithm,insertion method.Another is modern optimization algorithm which consists simulated annealing algorithm,artificial immune algorithm,genetic algorithm,ant colony algorithm,particle swarm optimization,Tabu Search,Hopfield neural network.The third is algorithm of DNA computing which is designed by authors.

第一种为传统算法，包括分支定界法、改良回路法、贪婪算法、MST算法、MM算法、插入法等；第二种为现代优化算法，包括模拟退火算法、人工免疫算法、遗传算法、蚁群算法、粒子群优化算法、禁忌搜索算法、Hopfield神经网络算法等；第三种为论文提出的DNA计算算法。

Quasi-convex relaxation algorithm, which aims to solve ordinary constraint global optimization problems, is produced by a combination of branch-and-bound method with quasi-convex lower bound and quasi-concave upper bound functions developed from quasi convex-concave extension. This algorithm extends the interval algorithm with box constraint to general constraint global optimization problem.

利用拟凸-凹扩张中构造出的函数的拟凸下界函数和拟凹上界函数，与分枝定界方法相结合，建立了求一般约束全局优化问题的拟凸松弛算法，这一算法是将盒子约束的区间算法推广到一般约束优化问题中。

Lugalbanda was a god and shepherd king of Uruk where he was worshipped for over a thousand years.

Lugalbanda 是神和被崇拜了一千年多 Uruk古埃及喜克索王朝国王。

I am coming just now,' and went on perfuming himself with Hunut, then he came and sat.

我来只是现在，'歼灭战perfuming自己与胡努特，那麼，他来到和SAT 。