运用多目标规划理论与分枝定界法对模型进行求解。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
该文首先给出一个最优解值的下界估计，它可用于分枝定界法求最优解。
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 basic ideas of the algorithm is due to concentrating of the brance-bound and the cutting-plane, but it decreases the number of the branch and simplifies the technique of the cutting-plane.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
研究积木块布图的二维压缩问题，提出一种采用分枝定界法的真正的二维压缩算法。
The two-dimensional compaction problem of building-block layout is considered in this paper.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
定义一种压缩树作为分枝定界法的基础。力图将所有的积木块尽可能向芯片的一个角压缩。
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.
非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.
非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.
应用推荐