cut branch and bound
基本解釋
- [數(shù)學(xué)]截支定界法
英漢例句
- Based on the model, we use the Branch-and-Bound algorithm to solve the max-cut problem.
在該模型的基礎(chǔ)上,利用分枝定界算法求解最大割問(wèn)題。 - People can get a list of ascending lower bound of minimum matching error and cut the useless search branch to get higher efficiency by the list of lower bound.
利用該結(jié)構(gòu)的特點(diǎn),削減匹配中無(wú)用的搜索分支,以達(dá)到提高處理效率的目的。
雙語(yǔ)例句
專(zhuān)業(yè)釋義
- 截支定界法
Based on the division of adjacent vertices set and different sequence technique, it proposes a new algorithm: cut branch and bound.
本文最后基于圖的鄰集分解及不同排序策略提出了一種新的精確算法——截支定界法。