Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
并通过理论分析提出一种启发式与分枝定界相结合的算法。
This paper first presents a branch-and-bound algorithm to minimize a finite sum of stair-case functions under linear constraints.
该文首先给出了求在线性约束下极小化有限个阶梯函数和的一种分枝定界算法。
With the aim at deriving optimal solutions, branch-and-bound method is one of the most well adopted implicit enumerative approaches.
为达成获得最佳解的目标，分支界定法是最常采用的列举法之一。
In the approach, using a branch-and-bound algorithm on the basis of a compaction tree, we attempt to move all blocks towards a corner of the chip.
定义一种压缩树作为分枝定界法的基础。力图将所有的积木块尽可能向芯片的一个角压缩。
Based on the general principle of the branch-and-bound method, the branching rule and the bounding calculating method to solve this problem are proposed.
根据分枝一定界法的基本原理，提出了解决该问题的分枝规则及其定界计算的方法。
It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
文中简单说明此问题为NP -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
At the same time, the branch-and-bound algorithm and greedy algorithm are developed to solve the model, and a numerical example is given to illustrate and test the algorithms.
同时给出了求解该模型的分支定界算法和贪婪算法，并通过一个数值例子说明和检验以上算法。
For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。
The routines implement the simplex, branch and bound, primal-dual interior point, and many other algorithms.
这些程序实现了simplex算法、branch and bound算法、primal - dualinteriorpoint算法以及很多其他算法。
In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.
本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Numerical experiments showed that the branch and bound method with these techniques was effective.
实验表明，基于这些结果所构造的分支定界算法是有效的。
The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
This paper discusses the problem of choosing optical cable route with branch and bound way and puts forward the model of planning route in Layered network.
本文利用分枝限界法解决了自愈环光缆路由的选择问题，提出了分层网络光缆路由规划的数学模型。
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem.
针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.
用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求。
We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.
该文首先给出一个最优解值的下界估计，它可用于分枝定界法求最优解。
In this paper, the problem for contract processing sequencing with penalty factor is studied and a branch and bound method for this problem is proposed.
本文研究了具有惩罚因子的合同加工排序问题，提出了相应的分枝定界算法。
The significant failure models are identified by using the modified branch and bound method.
用改进的分枝限界法判认主要失效模式。
In this paper, a new branch and its bound algorithm for solving integer separable concave programming problems is proposed, and the convergence of the algorithm is proved.
提出了一种新的解整数可分离凹规划问题的分支定界算法，并证明了其收敛性。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
应用推荐