- -

Greedy and K-Greedy algoritmhs for multidimensional data association

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Greedy and K-Greedy algoritmhs for multidimensional data association

Show full item record

Perea Rojas Marcos, F.; De Waard, HW. (2011). Greedy and K-Greedy algoritmhs for multidimensional data association. IEEE Transactions on Aerospace and Electronic Systems. 47(3):1915-1925. doi:10.1109/TAES.2011.5937273

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/58849

Files in this item

Item Metadata

Title: Greedy and K-Greedy algoritmhs for multidimensional data association
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Issued date:
Abstract:
[EN] The multidimensional assignment (MDA) problem is a combinatorial optimization problem arising in many applications, for instance multitarget tracking (MTT). The objective of an MDA problem of dimension $d\in\Bbb{N}$ ...[+]
Subjects: Combinatorial optimization problems , Multi-target tracking , Multidimensional assignment , Multidimensional data , NP-hard , Objective functions , Polynomial time heuristics , Combinatorial optimization , Optimization , Polynomial approximation , Algorithms
Copyrigths: Reserva de todos los derechos
Source:
IEEE Transactions on Aerospace and Electronic Systems. (issn: 0018-9251 )
DOI: 10.1109/TAES.2011.5937273
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Publisher version: http://dx.doi.org/10.1109/TAES.2011.5937273
Thanks:
This research was supported by a Marie Curie fellowship of the European Community program "Improving Human Research Potential and the Socio-economic Knowledge Base" under Contract HPMI-CT-2002-00221.
Type: Artículo

This item appears in the following Collection(s)

Show full item record