A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
A new class of Heuristic Polynomial Time Algorithms to solve the Multidimensional Assignment Problem
2006
2006 9th International Conference on Information Fusion
Preserved Fulltext
The multidimensional assignment problem (MAP) is a combinatorial optimization problem arising in many applications, for instance in multitarget multi-sensor tracking problems. It is wellknown that the MAP is NP-hard. The objective of a MAP is to match d-tuples of objects in such a way that the solution with the optimum total cost is found. In this paper a new class of approximation algorithms to solve the MAP is presented, named K-SGTS, and its effectiveness in multi-target multisensor tracking
doi:10.1109/icif.2006.301641
dblp:conf/fusion/PereaW06
fatcat:2hgpeufg3vgw7mpqehlx6yqio4