在该模型的基础上，利用分枝定界算法求解最大割问题。
Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
本文研究了资源有限—工期最短的优化问题，提出了相应的分枝定界算法。
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.
本文研究了具有惩罚因子的合同加工排序问题，提出了相应的分枝定界算法。
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.
该文首先给出了求在线性约束下极小化有限个阶梯函数和的一种分枝定界算法。
This paper first presents a branch-and-bound algorithm to minimize a finite sum of stair-case functions under linear constraints.
针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem.
提出了一种解带有二次约束二次规划问题的新的分枝定界算法对该算法进行了收敛性分析。
We present a new branchandbound algorithm for solving quadratic programming problem with quadratic constraints, and analyze the convergence of the algorithm.
非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.
文中简单说明此问题为NP -难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。
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.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
并通过理论分析提出一种启发式与分枝定界相结合的算法。
Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
对分枝定界和堆栈算法采用本文提出的排序QR分解算法在检测前对信号排序。
The sorted QR decomposition algorithms proposed in this paper are used to sort signal in BB and stack algorithms.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。
The paper presents an algorithm of scheduling aircraft landing time based on branch and bound(ASAL). Experiments show the proposed m…
研究积木块布图的二维压缩问题，提出一种采用分枝定界法的真正的二维压缩算法。
The two-dimensional compaction problem of building-block layout is considered in this paper.
研究积木块布图的二维压缩问题，提出一种采用分枝定界法的真正的二维压缩算法。
The two-dimensional compaction problem of building-block layout is considered in this paper.
应用推荐