By Topic

A new class of Heuristic Polynomial Time Algorithms to solve the Multidimensional Assignment Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. Perea ; AWS Department, Thales Naval Nederland B.V., The Netherlands. ; H. W. De Waard

The multidimensional assignment problem (MAP) is a combinatorial optimization problem arising in many applications, for instance in multi-target multi-sensor tracking problems. It is well-known 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 multi-sensor tracking situations is shown. Its computational complexity is proven to be polynomial. Experimental results on the accuracy and speed of K-SGTS are provided in the last section of the paper

Published in:

2006 9th International Conference on Information Fusion

Date of Conference:

10-13 July 2006