片语

a branch and bound一个分支定界

the branch and bound分枝定界

Branch and Bound Approach分枝定界法

branch and bound model分店模式

Branch and bound research分枝

branch-and bound technique分公司

branch and bound strategy分支与界限策略

cut branch and bound截支定界法

英汉例句

• the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm's efficiency and get the optimal solution soon.

  本文选用旅行商（tsp）问题实例作为测试基準。 计算表明，在保证求得最优解的前提下，该平台能很好地提高分支定界算法的效率。

• 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.

  理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的，嵌入分支定界法可以提供好的界。

• furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.

  借鑒有效集上优化问题的面搜索方法，给出了一种基于面搜索的分支定界法。

• branch and bound method in form of a decision tree.

  利用分枝定界法，并采用决策树形式求解。

• because of plentiful variables and nonlinear constrains, the model is difficult to solve accurately by conventional method, such as branch and bound algorithm.

  由于非线性约束及供应链网络庞大的变量和约束条件，常规的分支定界法难以精确求解。

• in this paper we propose a new branch and bound algorithm for cost minimization problems arising in series-parallel reliability networks.

  本文对可靠性网络中串-并系统的费用最小化问题提出一种新的分枝定界算法。

• to develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.

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

• branch and bound (b&b) is a problem solving technique which is widely used for various problems encountered in operations research and combinatorial mathematics.

  分枝界限算法是求解组合优化问题的技术之一，它被广泛地应用在埃运筹学与组合数学中。

• 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.

  本文利用分枝限界法解决了自愈环光缆路由的选择问题，提出了分层网络光缆路由规划的数学模型。

• a branch and bound methods is proposed for minimizing concave function over a convex.

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

• in this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.

  本文设计实现的一种专用于计算分支定界算法的机群计算平台，能减少分支定界算法的计算时间复杂度，提高分支定界算法的效率。

• depending on the operators - you might be able to use some branch and bound techniques.

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

• in the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.

  在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。

• nonlinear programming techniques, branch and bound algorithms and incomplete cholesky decomposition conjugate gradient method (iccg) are the three main parts of our work.

  非线性优化技术、分枝定界算法和不完全乔莱斯基分解的预优共轭梯度法是该工作的三个主体部分。

• this paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem.

  针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法。

• proposes a hybrid algorithm that integrates constraint propagation technique and branch and bound algorithm to solve the hybrid flow shop scheduling problem.

  将约束传播技术同分枝定界法相结合求解优化目标为最小最大完工时间的混合流水车间调度问题。

• an interactive and integrated algorithm is proposed to solve this problem by using the interactive idea and the principle of branch and bound method.

  利用交互式的思想和分枝-定界法的基本原理，提出了一种求解该问题的交互式整体优化方法。

• a reduced branch and bound approach for solving quadratic programming problem with quadratic constraints;

  以分支定界法为例，介绍了其设计思想和实践步骤，并对算法的时间复杂度进行了分析。

• in this paper a new exact algorithm is proposed for solving project scheduling problems under multiple resource constrains which is based on the branch and bound procedure.

  基于分支定界法的思想提出了一种新的精确求解多资源约束下项目进度规划问题的最优化算法。

• in this paper, we present a new branch and bound algorithm for finding an approximate globally optimal solution to a convex quadratic bilevel programming problem with any given accuracy.

  本文提出了一种新的分支定界法，用以求出满足给定的精度的二次双层优化问题的近似解。

• this article presents a branch and bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region.

  本文针对一类带有反凸约束的凸函数比式和问题提出了一种求其全局最优解的分支定界算法。

• based on these two methods, two branch and bound algorithms are developed and performed.

  根据这两个下界，提出并实现了分支定界算法。

• technical route of reliability analysis for complex large-scale structures is presented and the global branch and bound algorithm for main failure modes identification is introduced.

  首先讨论了大型复杂结构可靠性分析的技术路线，介绍了用于识别主要失效模式的全局分枝-约界法；

• with these criteria and methods, a branch and bound algorithm for acquiring the optimal solution of the scheduling model is designed.

  利用这些消去準则和上下界估计设计了一个求该问题最优解的分枝定界法算法；

• branch and bound strategy is used to optimize the local problem.

  该算法应用分枝定界法实现局部问题的优化。

• traditional methods include dynamic programming, greedy algorithms, local search heuristics and branch and bound algorithms.

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

• branch and bound (b&b) algorithm is one of the fundamental methods for combinatorial optimization problems.

  分枝界限算法是解决组合优化问题的常用方法之一。