查询词典 branch

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 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.

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

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.

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

And Pharaoh spoke to Joseph, saying, Your father and your brothers have come to you.

47：5 法老对约瑟说，你父亲和你弟兄们到你这里来了。

Additionally, the approximate flattening of surface strip using lines linking midpoints on perpendicular lines between geodesic curves and the unconditional extreme value method are discussed.

提出了用测地线方程、曲面上两点间短程线来计算膜结构曲面测地线的方法，同时，采用测地线间垂线的中点连线和用无约束极值法进行空间条状曲面近似展开的分析。