全部

1·A branch and bound methods is proposed for minimizing concave function over a convex.

本文介绍了求解凸集上凹函数最优解的一种分支定界方法。

2·Depending on the operators - you might be able to use some branch and bound techniques.

根据运营商，你可以使用一些分支界限法技术。

3·The significant failure models are identified by using the modified branch and bound method.

用改进的分枝限界法判认主要失效模式。

4·Numerical experiments showed that the branch and bound method with these techniques was effective.

实验表明，基于这些结果所构造的分支定界算法是有效的。

5·The model is calculated by applying multi-target programming theory as well as branch and bound method.

运用多目标规划理论与分枝定界法对模型进行求解。

6·The routines implement the simplex, branch and bound, primal-dual interior point, and many other algorithms.

这些程序实现了simplex算法、branch and bound算法、primal - dual interior point算法以及很多其他算法。

7·To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.

为设计求解该问题的分支定界算法，建立了非线性整数规划模型。

8·To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.

分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。

9·A general subset selection method, the branch and bound technique, is applied to a control structure selection problem.

一种通用的子集合选择方法一分支定界法被应用于控制结构选择问题。

10·Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.

传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。