1.
Application of Branch and Bound Algorithm on Dispatching Problem
分支定界算法在调度问题上的应用
2.
The Application of Branch and Bound Algorithm in the Model of Operational Research
分支定界算法在运筹学模型中的应用
3.
Branch & bound algorithm in leukocyte feature selection using
分支定界算法在白细胞特征选择中的应用研究
4.
Branch-and-bound algorithm for design of FIR filters with discrete coefficients
解离散系数滤波器设计问题的分支定界算法
5.
New branch-and-bound algorithm for indefinite quadratic programming problems
求不定二次规划问题全局解的新的分支定界算法
6.
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.
计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。
7.
Branch and Bound Processing of Skyline Queries Based on TPU-tree
基于TPU-tree的Skyline分支定界查询算法(英文)
8.
A Study on Reactive Power Optimization Based on Improved Primal-Dual Interior Point Method and Branch-And-Bound Method;
基于改进原对偶内点算法及分支定界法的无功优化研究
9.
A SoC Design Exploration Algorithm Based on Branch-and-Bound and List Scheduling
一种基于分支定界和表调度的SoC设计方案搜索算法
10.
A SIMPLIFIED METHOD FOR SHALLOW SHELLS WITH SIMPLE SUPPORTS BY BEM
边界元法分析周边简支扁壳的一种简便计算
11.
Branch and Bound Algorithm for the Time Dependent Chinese Postman Problem;
时间依赖网络中国邮路问题的分支限界算法
12.
Branch-and-Bound Technique for Generation Algorithm of Optimal Coalition Structure
最优联盟结构生成算法中的分支限界技术
13.
Analysis on Sensitivity of One Algorithin of Efficient Boundary;
一种确定有效边界算法的灵敏度分析
14.
The new calculating method of stationary voltage stability critical node is put forward by analyzing the ability of the load power of simple alternative circuit branch.
通过分析简单交流支路的功率负荷能力,提出了求取静态电压稳定临界点的新算法。
15.
Relationship Between the One-dimensional Accurate Search Method and the Branch and Bound Algorithm;
一维精确搜索方法与分支定界法的联系
16.
Research on Unit Commitment Based on Interior Point-Branch and Bound Method;
基于内点—分支定界法的最优机组投入研究
17.
Project Scheduling under Multiple Resource Constraints Based on Branch and Bound Procedure
基于分支定界法的多资源约束下项目进度规划
18.
Comparison of Color Solution via Hungarian Algorithm and Branch-and-bound Method
匈牙利算法与分枝定界法解决调色问题之比较