branch-and-bound algorithm

基本解釋

Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
并通過理論分析提出一種啟發(fā)式與分枝定界相結(jié)合的算法。
It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.
文中簡(jiǎn)單說(shuō)明此問題為NP-難問題，并提出了一種動(dòng)態(tài)規(guī)劃算法和一種分枝定界算法來(lái)求得此問題的最優(yōu)解。
At the same time, the branch-and-bound algorithm and greedy algorithm are developed to solve the model, and a numerical example is given to illustrate and test the algorithms.
同時(shí)給出了求解該模型的分支定界算法和貪婪算法，并通過一個(gè)數(shù)值例子說(shuō)明和檢驗(yàn)以上算法。