branch-and-bound

常見(jiàn)例句

Extensive computational experiment shows that the branch-and-bound method is efficient in solving concave integer programming problems.
數(shù)值結(jié)果表明，用這種分枝定界方法求解凹整數(shù)規(guī)劃是有效的。
In this paper, some characteristics and processing steps about branch-and-bound method(B&B) are analyzed in more details , and some strategies, used to solving optimal problems by B&B , are discussed.
較為詳細(xì)地分析了分枝定界法的算法特征和過(guò)程，討論了以該算法求解具體優(yōu)化問(wèn)題時(shí)所要采取的算法策略。
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.
本文介紹了混合整數(shù)兩層線性規(guī)劃問(wèn)題，引入代理約束，構(gòu)造計(jì)算簡(jiǎn)單的定界函數(shù)，提出一個(gè)分支定界算法，并給出算例說(shuō)明算法是有效的。