Study on relaxation algorithm of assignment problem

被引：0
|
作者：
Liu, Qiming [1 ]
Bai, Shu-yan [1 ]
Zhang, Fu-zeng [1 ]
机构：
[1] Lu Dong Univ, Sch Comp Sci & Technol, Yantai 264025, Peoples R China
来源：
General System and Control System, Vol I | 2007年
关键词：
assignment problem; data association; Lagrangian relaxation algorithm;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Among various data association algorithms of S-dimensional(S-D) assignment problem, Lagrangian relaxation algorithm has a dominant role owing to its satisfying result in application. This paper studies the variation of data association result caused by the relaxation sequence of Lagrangian relaxation algorithm of multidimensional assignment problem from both theory and experiment. The simulation results show that the right relaxation sequence can improve the effect of data association of Lagrangian relaxation algorithm in great degree.
引用
收藏
页码：297 / 300
页数：4
相关论文
共 50 条
12345