This paper introduces the basic principles of the branching bounding algorithem It mainly discusses two difficult points during the implementation of theis algorithm They are the searching of the branching node and the replace of the data of the active nod
本文介绍分支与定界算法的基本原理 ,着重讨论了此算法在具体实现过程中遇到的两个难点 :分支结点的寻找和当前结点对应数据的生
An efficient branch and bound algorithm for CMST problem;
CMST问题的高效分支定界算法研究
Aimed at the lack of research on two-sided assembly line balancing problem status in quo,the characteristics of two-sided assembly line were analyzed and the special requirements of balancing were studied,the mathematical model was built,then a balancing algorithm which was based on branch and bound was developed.
针对目前研究较少的双边装配线平衡问题,分析、研究了双边装配线的特点及其对平衡的特殊要求,建立双边装配线平衡问题的数学模型,并提出一种分支定界算法来最优化装配线的平衡。
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
In order to solve this model, a revised branch-and-bound algorithm is designed and illustrated by a numerical example.
通过对模型特征分析,提出了一种分枝定界算法,实例应用及算法复杂性分析证明了该算法的有效性。
Finally, a branch-and-bound algorithm is presented.
本文根据运输问题中一类常见的情况建立了在并容量网络中求最大并流的网络模型，证明了最大并流问题的NP完全性，并给出了求解该问题的一种分枝定界算法。
A reduced branch and bound approach for solving quadratic programming problem with quadratic constraints;
带有二次约束的二次规划问题的一个收缩分枝定界算法
This model is a mixed integerlinear program (MILP), and is solved with a branch and bound (B&B) algorithm.
针对废弃物品的收集、预处理和再制造问题,建立了回收物流设施选址混合整数规划(MILP)模型,用分枝定界法求解。
This paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
本文讨论了该问题 ,并提出一种求指派问题多重最优解的分枝定界
To speed up retrieval, the index is built up based on Keogh lower bound.
不同于经典的基于几何空间位置的检索方法,首先提出基于运动能量的描述人体运动的模型,在此基础上引入熵的概念,提取能体现运动特征的关键关节作为衡量动作相似性的基准;然后利用Keogh定界算法建立索引,以加快检索速度;最后,利用动态时间变形算法计算运动例子和检索集之间的相似度,确定检索结果集。