A branch and bound methods is proposed for minimizing concave function over a convex.
本文介绍了求解凸集上凹函数最优解的一种分支定界方法。
Depending on the operators - you might be able to use some branch and bound techniques.
根据运营商，你可以使用一些分支界限法技术。
The significant failure models are identified by using the modified branch and bound method.
用改进的分枝限界法判认主要失效模式。
Numerical experiments showed that the branch and bound method with these techniques was effective.
实验表明，基于这些结果所构造的分支定界算法是有效的。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
运用多目标规划理论与分枝定界法对模型进行求解。
The routines implement the simplex, branch and bound, primal-dual interior point, and many other algorithms.
这些程序实现了simplex算法、branch and bound算法、primal - dualinteriorpoint算法以及很多其他算法。
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.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
A general subset selection method, the branch and bound technique, is applied to a control structure selection problem.
一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。
Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.
传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。
Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.
借鉴有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。
We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.
该文首先给出一个最优解值的下界估计，它可用于分枝定界法求最优解。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
最后，本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
The proposed GA algorithm is verified effective by comparing with the Branch and Bound method on small sized numerical experiments.
通过分支定界法对小规模算例的验证表明，本遗传算法获得精确解的比例是高的，由此认为所给遗传算法是很有效的。
The paper presents an algorithm of scheduling aircraft landing time based on branch and bound(ASAL). Experiments show the proposed m…
该文提出了基于分枝定界的飞机着陆调度排序算法——ASAL，实验证明通过该算法能够很好地解决飞机着陆调度优化问题。
This paper discusses the problem and presents a branch and bound technique to find alternate optimal solutions for assignment problem.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.
用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求。
This article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.
本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。
This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem.
针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。
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 discusses the problem of choosing optical cable route with branch and bound way and puts forward the model of planning route in Layered network.
本文利用分枝限界法解决了自愈环光缆路由的选择问题，提出了分层网络光缆路由规划的数学模型。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
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.
本文研究了资源有限—工期最短的优化问题，提出了相应的分枝定界算法。
Nonlinear programming techniques, branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.
非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Also developed for the PRA tree is an enhanced predictive range aggregate (EPRA) query algorithm which USES a more precise branch and bound searching strategy, reducing the disk I?
提出了一种增强预测范围聚集查询epra算法，采用更精确的剪枝搜索准则，减少了查询所需要访问的节点代价。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
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.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
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.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。
应用推荐