branch-and-bound
英 [brɑːntʃ ənd baʊnd]
美 [bræntʃ ənd baʊnd]
网络 分支定界; 分支限界; 分支定界法; 分枝定界; 枝节法
双语例句
- In this paper, a branch-and-bound algorithm for Lipschitz optimization with box constraints is studied.
研究箱约束李普希兹优化问题的分支定界算法。 - New branch-and-bound algorithm for indefinite quadratic programming problems
求不定二次规划问题全局解的新的分支定界算法 - Branch-and-Bound Technique for Generation Algorithm of Optimal Coalition Structure
最优联盟结构生成算法中的分支限界技术 - Branch-and-bound algorithm for design of FIR filters with discrete coefficients
解离散系数滤波器设计问题的分支定界算法 - Analysis on Maintenance Optimization of Distribution Lines Based on Branch-and-Bound Algorithm
基于分支界限法的配电线路检修优化分析 - 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.
文中简单说明此问题为NP-难问题，并提出了一种动态规划算法和一种分枝定界算法来求得此问题的最优解。 - The conventional surrogate constraint method, which can improve the efficiency of branch-and-bound or cutting plane algorithms, can not guarantee to find the optimal solution of the primal problem.
传统的代理约束方法虽可加速分支定界法或割平面法的求解速度，但往往会扩大原问题的可行域，不能保证得到原问题的最优解。 - Comparison of Color Solution via Hungarian Algorithm and Branch-and-bound Method
匈牙利算法与分枝定界法解决调色问题之比较 - In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。 - The theorem of structural continual variation was used to analyze reliability of frame structure. The method was combined with probability analysis and numerical calculus and recurrence formula and branch-and-bound method to evaluate the system.
将概率计算、递推公式和数值分析相结合的结构连续变更方法用于刚架结构的可靠性分析，实现了结构内力和极限状态函数的连续生成，计算了结构总体失效概率。 - This paper describes a mathematical model for the problem of marshalling single group freight trains at technical stations in a network with a number of constraints. An heuristic algorithm and a branch-and-bound algorithm are proposed for the model.
本文对路网上技术站多种能力约束下的单组列车编组问题建立了整体性数学模型，并提出了一种启发式算法和一种分枝定界算法。 - Based branch-and-bound method, a new method to identify the dominant failure modes is presented.
基于分枝限界法，提出了一种准确判认主要失效模式的新方法。 - Extensive computational experiment shows that the branch-and-bound method is efficient in solving concave integer programming problems.
数值结果表明，用这种分枝定界方法求解凹整数规划是有效的。 - Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在该模型的基础上，利用分枝定界算法求解最大割问题。 - Scheduling of flexible-resource flow shop, including programming model, resource distribution principle and branch-and-bound algorithm;
柔性资源流水线计划（FRFS）的制定。包括问题的规划模型，资源分配的基本原则和分枝定界法； - On the selection of primer in PCR experiments, we prove that minimizing the number of primers needed for amplification of a collection of DNA sequence is NP-complete. Then we design and implement a branch-and-bound algorithm and a greedy heuristic approximation algorithm.
在PCR试验中的引物选择问题中，证明了对扩展&DNA序列集合所需的引物个数进行最小化问题是NP-complete，设计并实现了分支限界算法和启发式贪婪近似算法。 - An approach by combining sensitivity analysis with branch-and-bound method
一种灵敏度分析与分枝定界法结合使用的方法 - A branch-and-bound algorithm for minimizing a finite sum of staircase function under linear constraints
极小化有限个阶梯函数和的一种分枝定界算法 - Study on optimal power flow based on primal-dual interior point algorithm under perturbed KKT conditions and branch-and-bound method
基于扰动KKT条件的原始-对偶内点法和分支定界法的最优潮流研究 - The strategy of highest-level-first with estimated times greatly reduces the tentative number of Branch-and-Bound algorithm.
算法所采用的最高位级优先的估时策略，大大减少了分枝定界算法的试探次数。 - This paper proposes portfolio model with exponential weighted index and fixed and proportional transaction costs, set up an aided mathematical programming, which is useful to estimation for the approximation solution and bound in branch-and-bound method.
本文提出了具有指数赋权指标以及固定的和比例的交易费的资产组合模型，给出了辅助的数学规划，利用它可以得到近似解或用于分支-定界方法中界的估计。 - 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.
根据分枝一定界法的基本原理，提出了解决该问题的分枝规则及其定界计算的方法。 - The algorithm uses a branch-and-bound method based on Lagrangian relaxation and dual search.
该算法是一个基于拉格朗日松弛和对偶搜索的分枝定界方法。 - It is improved in this paper, so that it is easily used to solve mixed-model assembly lines scheduling problem. The results show that the solution of this new algorithm is better than the one which branch-and-bound algorithm, simulated annealing algorithm and genetic algorithm.
实验表明：改进的蚁群算法解决了混流装配线的调度问题，得到了优于分支定界法、模拟退火法和遗传算法的可行解。 - The branch-and-bound algorithm is an important and efficient method to many problems.
分支限界策略对很多实际问题是重要和有效的。 - Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
并通过理论分析提出一种启发式与分枝定界相结合的算法。 - For the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.
提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。 - Our main results are as follows: the NP-hardness of the problem, a branch-and-bound algorithm and related properties.
这就提出了最优控制树问题.似乎此问题与最优支撑树问题十分类似，但我们将证明它是NP-困难的，并给出一个分枝定界算法及相关性质。 - The new algorithm utilizes two factors to restrict the scale of branch-and-bound algorithm and the convergence conditions.
新算法使用两个参数分别限制分枝定界法的规模和算法的收敛条件。 - A branch-and-bound algorithm, heuristic algorithm, tabu-search algorithm and Simulated Annealing Algorithm are further proposed.
进一步的，本文给出了求解该类问题的几个算法&分支定界算法、启发式算法、禁忌搜索算法和模拟退火算法。