您要查找的是不是：
- This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem. 针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
- There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm. 对于二层规划问题有许多经典的求解方法,如极点搜索法、分支定界法和罚函数法等。
- Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Parallelization is an effective means to improve the algorithm performance. 分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
- The results show that in comparison with the branch and bound algorithm, the proposed metaheuristics can obtain better objective function values in less computational time. 结果显示，与分支界限法相比较，所发展出来的通用启发式演算法可以使用较少的计算时间，并得到不错的目标函数值。
- The solving TSP( Traveling Salesman Problem) examples as benchmark shows that this platform can increase the branch and bound algorithm's efficiency and get the optimal solution sooner. 计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。
- Based on 0-1 integer linear programming,mathematics model is set and solved by linprog function in optimistic toolbox of MATLAB 6.5.The solution only containing zeros and ones is acquired using branch and bound algorithm. 在0-1整数规划的基础上建立了数学模型;利用MATLAB 6.;5优化工具箱中的linprog函数进行求解;再经过分支定界算法计算;求出了只含有0和1的解
- An algorithm in finding minimal reduction based on Propositional Satisfiability(abbreviated as SAT) algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem. 本文提出了一种求最小约简的基于命题可满足性(简称SAT)的算法,提出一个解决SAT问题的分割和结合的算法。
- Abstract： Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems.Parallelization is an effective means to improve the algorithm performance. 摘 要： 分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
- A bundle of twigs, sticks, or branches bound together. 柴把把细枝、枯枝或枝条捆成束
- Using some numerical examples, we compare the performance of the proposed algorithms with an optimum algorithm, namely the branch and bound algorithm. 我们使用了一些数学范例，并应用一种称为分支界限化的最佳化演算法来比较所发展的演算法之效率。
- To deal with such an NP-hard problem, the paper proposes two dynamic programming algorithms, a branch and bound algorithm with a polynomial solvable case. 对于这一NP-困难的排序问题，本文给出了两个动态规划解法及其多项式可解的特例，并给出了一个分枝定界算法。
- Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work. 非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分.
- The exact solution proposed to the remaining of COP is a hybrid method combined with dynamic program, bound algorithm and heuristics. 最后综合动态规划方法、下界算法和近似方法提出了一种精确求解同顺序加工调度问题的启发式双侧广度优先搜索方法。
- A Branch and Bound Algorithm for Time Table Problem 求解课程表问题的分支定界算法
- She had her hair bound up in a neckerchief. 她把头发用围巾包起来。
- Bind down the ropes around the load on the lorry. 把绕在卡车上货物外面的绳子扎紧。
- A New Branch and Bound Algorithm for Solving Complex Integer Quadratic Programs 解复杂二次整数规划问题的新型分枝定界算法
- The company has branch out into car leasing. 该公司业务范围已扩大到汽车租赁。
- The wound was bound up by bandage. 伤口用绷带包扎着。
- The acoustics is a branch of physical. 声学是物理学的一个分支。
