%0 Journal Article
%T Optimal path algorithm with multi-constrained condition<br>带多约束条件的最优路径选择算法研究
%A ZOU Yong-gui
%A WEI Lai
%A <br>邹永贵
%A 魏来
%J 计算机应用
%D 2008
%I 
%X Traditional heuristic algorithm converts the NP-complete problem to a simpler one that can be solved in polynomial time. However, it cannot guarantee a solution all the time. In this paper, the Lagrange relaxation was applied to traditional heuristic algorithm to improve the successful rate of finding an optimal path and to reduce the time complexity. Finally, the correctness and effectiveness of this algorithm are proved through experiment and analysis.
%K lagrangean relaxation
%K multi-weighted graph
%K optimal paths
%K multi-constrained<br>拉格朗日松弛
%K 多权值图
%K 最优路径
%K 多约束条件
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=7EE9FBAC533FC52646C0526BEADEAE5F&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=94C357A881DFC066&sid=C17A97755771D03C&eid=17FE7A1C78626A81&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=12