In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
With the aim at deriving optimal solutions, branch-and-bound method is one of the most well adopted implicit enumerative approaches.
为达成获得最佳解的目标，分支界定法是最常采用的列举法之一。
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.
根据分枝一定界法的基本原理，提出了解决该问题的分枝规则及其定界计算的方法。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
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.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
Numerical experiments showed that the branch and bound method with these techniques was effective.
实验表明，基于这些结果所构造的分支定界算法是有效的。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
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.
用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求。
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 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.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.
该文首先给出一个最优解值的下界估计，它可用于分枝定界法求最优解。
The significant failure models are identified by using the modified branch and bound method.
用改进的分枝限界法判认主要失效模式。
The proposed GA algorithm is verified effective by comparing with the Branch and Bound method on small sized numerical experiments.
通过分支定界法对小规模算例的验证表明，本遗传算法获得精确解的比例是高的，由此认为所给遗传算法是很有效的。
In this pater, the problem of limited resources and shortest time limit for a project is studied and an algorithm of branch and bound method for this problem is proposed.
本文研究了资源有限—工期最短的优化问题，提出了相应的分枝定界算法。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
A general subset selection method, the branch and bound technique, is applied to a control structure selection problem.
一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.
非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
运用多目标规划理论与分枝定界法对模型进行求解。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
应用推荐