branch and bound algorithm

"branch and bound algorithm"的翻譯和解釋

"查查詞典"手機(jī)版

千萬人都在用的超大詞匯詞典翻譯APP

例句與用法

Methods such as branch and bound algorithm , mixed integer programming , transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm
近年來求解選址模型用得較多的數(shù)學(xué)優(yōu)化方法有分支定界法、混合整數(shù)規(guī)劃法、運(yùn)輸模型法、可分離線性規(guī)劃法。
2 . presenting a modified branch and bound algorithm by adding the heuristic algorithm in the cluster which increasing the efficiency of eliminating node . 3 . the problem ’ s scale is decreased through using distributed parallel computing algorithm
2 .詳細(xì)研究了幾種主要的啟發(fā)式算法,并使用啟發(fā)式算法修改了分支定界算法,在保證計算精度的前提下,提高了分支節(jié)點(diǎn)的淘汰效率。
Based on our extensive study of many different scheduling optimizations , we can summarize the results into five scheduling rules . based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model
根據(jù)不同生產(chǎn)方式優(yōu)化調(diào)度研究成果得出了五個調(diào)度規(guī)則，應(yīng)用這些規(guī)則與分枝定界方法分別構(gòu)造出上、下層調(diào)度模型的啟發(fā)式分枝定界優(yōu)化算法。
The theory results and heuristics of the maximum clique problem are described and the branch and bound algorithms are discussed in detail in this paper . based on these existing algorithms , we present a new branch and bound algorithm for the maximum weight clique problem
本文首先對當(dāng)前國際上最大團(tuán)問題的理論研究成果及算法研究中的啟發(fā)式算法進(jìn)行了介紹，然后對精確算法中的分支定界法作了較為詳細(xì)的討論，最后作者在現(xiàn)有算法的基礎(chǔ)上，給出了最大加權(quán)團(tuán)問題的一種新的分支定界算法。
A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed , in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique
摘要構(gòu)造出了一類可分離非線性0 - 1背包問題的分枝定界算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發(fā)式法確定更好的可行解；而在每個分枝結(jié)點(diǎn)處用線性松弛技術(shù)確定了它的子問題的一個線性規(guī)劃松弛逼近，由此得到最優(yōu)值的一個下界。
Abstract : a cad tool based on a group of efficient algorithms to verify , design , and optimize power / ground networks for standard cell model is presented . nonlinear programming techniques , branch and bound algorithms and incomplete cholesky decomposition conjugate gradient method ( iccg ) are the three main parts of our work . users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed . the experimental results prove that the algorithms can run very fast with lower wiring resources consumption . as a result , the cad tool based on these algorithms is able to cope with large - scale circuits
文摘:介紹了一個基于標(biāo)準(zhǔn)單元布圖模式的電源線/地線網(wǎng)絡(luò)的輔助設(shè)計集成工具.它應(yīng)用了一系列高效的算法,為用戶提供了電源線/地線網(wǎng)絡(luò)的設(shè)計、優(yōu)化和驗證的功能.非線性優(yōu)化技術(shù)、分枝定界算法和不完全喬萊斯基分解的預(yù)優(yōu)共軛梯度法是該工作的三個主體部分.用戶可以選擇使用非線性規(guī)劃的方法或者幾種分枝定界方法來滿足他們對于精度和速度方面的不同需求.實驗結(jié)果表明,文中所提供的算法可以在很快的運(yùn)行速度下實現(xiàn)更低的布線資源占用.因此,在這些有效算法基礎(chǔ)上實現(xiàn)的輔助設(shè)計工具具有處理大規(guī)模電路的能力