基本解釋[計(jì)算機(jī)科學(xué)技術(shù)]分支與界限搜尋分支定界搜尋英漢例句雙語(yǔ)例句Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.傳統(tǒng)的求解方法包括動(dòng)態(tài)規(guī)劃法、貪婪算法、局部搜索法和分支定界法等。Furthermore, a branch and bound algorithm based on face search which comes from optimization over efficient set is described.借鑒有效集上優(yōu)化問(wèn)題的面搜索方法，給出了一種基于面搜索的分支定界法。A procedure for judging the existence of feasible solution is proposed. In the branch and bound algorithm, the forward search strategy is adopted, a modified bound …在分枝定界數(shù)值算法中，采用了前向搜索策略，提出了定界算法，討論了重復(fù)解的消除方法，并用示例說(shuō)明了算法在減小搜索空間上的有效性。branch and bound search更多例句詞組短語(yǔ)短語(yǔ)branch -and-bound search 翻譯branch and bound search更多詞組專業(yè)釋義計(jì)算機(jī)科學(xué)技術(shù)分支與界限搜尋分支定界搜尋