%0 Journal Article
%T Research on distributed parallel computing for branch and bound algorithm<br>分支定界算法的分布并行化研究
%A LI Yi-ming
%A LI Yi
%A ZHOU Ming-tian
%A <br>李一明
%A 李毅
%A 周明天
%J 计算机应用
%D 2006
%I 
%X The realization of a special cluster for calculating branch and bound algorithm was presented. The distributed parallel strategy in the cluster decreased the branch and bound running time from three aspects: (1)the problem's scale was decreased by using distributed parallel computing; (2)the present optimal value which was calculated by any computer could be broadcast to every computer in the platform immediately; (3) the changed branch and bound algorithm with the heuristic algorithm in the cluster increases the efficiency of eliminating node. The solving TSP(Traveling Salesman Problem) examples as benchmark shows that this platform can increase the branch and bound algorithm's efficiency and get the optimal solution sooner.
%K branch and bound algorithm
%K distributed parallel computing
%K heuristic algorithm
%K traveling salesman problem<br>分支定界算法
%K 分布并行计算
%K 启发式算法
%K 旅行商问题(TSP)
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=9E5274C98EA2B6C3&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=38B194292C032A66&sid=19402779123D7C0E&eid=C3E1E0E568E449E1&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=9