Three Algorithms for a Class of Multidimensional Assignment Problems

CIT. Journal of Computing and Information Technology

Rijavec, N.¹  B. Poore, A.¹ 

[1] Department of Mathematics, Colorado State University, Fort Collins, U.S.A.

关键词: Multitarget tracking;    multi-dimensional assignment problems;    data association;    Lagrangian relaxation;    Greedy;    Branch;    Bound;   

DOI  :  

学科分类：计算机科学（综合）

来源: Sveuciliste u Zagrebu

【 摘 要 】

The assignment problem of matching the elements of two sets at some cost or to some benefit is well known and can be solved in polynomial time. However, many applications, particularly those in remote sensing and computer vision, require...

【 授权许可】

Unknown