大人和孩做爰av,国产午夜精品av一区二区

TranslationMobile

分枝定界法
分枝界限法

"branch" in Chinese : n. 1.(樹)枝〔泛指大枝或小枝；bough 特指大枝 ...
"bound" in Chinese : adj. 〔作述語用〕 1.開往(某處)去的，要往(某處 ...
"branch and bound algorithm" in Chinese : 分枝界定法; 分支定界法
"branch and bound method" in Chinese : 分枝界限法; 分支和限界法; 分支界限法; 分支限界法; 分支與定界法
"branch and bound model" in Chinese : 分店模式
"branch and bound procedure" in Chinese : 分支界限法
"branch and bound search" in Chinese : 分支界限搜索
"branch and bound strategy" in Chinese : 分支界限策略
"branch and bound technique" in Chinese : 分支界限技術(shù)
"branch bound algorithm" in Chinese : 分支界限算法
"branch bound method" in Chinese : 分支估界法
"branch bound technique" in Chinese : 分支限界技術(shù)
"branch-and-bound method" in Chinese : 分枝限界法; 界定法
"branch-and-bound search" in Chinese : 分枝限界搜索
"branch-and-bound solution strategy" in Chinese : 分支限界解法

Examples

Balancing two - sided assembly line based on branch and bound way
多品種混合型裝配流水線的平衡設(shè)計
A new branch and bound algorithm for solving complex integer quadratic programs
解復(fù)雜二次整數(shù)規(guī)劃問題的新型分枝定界算法
Branch and bound algorithm
分枝界定法
A branch and bound algorithm for solving maximizing a concave function over weakly - efficient
弱有效集上凹函數(shù)極大問題的分枝定界算法
Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems
分支定界算法是求解優(yōu)化問題的重要方法。
4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon
計算表明,在保證求得最優(yōu)解的前提下,該平臺能很好地提高分支定界算法的效率。
When problem scale is small , we can adopt many classical algorithms such as linear programming integer programming , branch and bound method to solve this problem
當(dāng)問題規(guī)模較小時，可用線性規(guī)劃、整數(shù)規(guī)劃、動態(tài)規(guī)劃等經(jīng)典算法求解。
This paper consists of two parts . in the first part , a new branch and bound algorithm for minimizing the nonconvex quadratic programming with box constraints is proposed
本文分兩部分，第一部分研究求解邊界約束非凸二次規(guī)劃問題的整體最優(yōu)解的分支定界算法。
The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner
計算表明，在保證求得最優(yōu)解的前提下，該平臺能很好地提高分支定界算法的效率。
To improve the efficiency of the branch and bound technique , some heuristic principles are proposed to cut those branches that may generate global optimization solution with low probability
同時，為提高分支定界法的效率，利用啟發(fā)式規(guī)則剪去產(chǎn)生最優(yōu)解可能性很小的分支。