Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
From MaRDI portal
Publication:1318276
DOI10.1007/BF01299390zbMath0818.93070MaRDI QIDQ1318276
Publication date: 28 April 1994
Published in: Computational Optimization and Applications (Search for Journal in Brave)
multiple hypothesis trackingdata associationmultitarget trackingmultidimensional assignment problems
Related Items
Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces ⋮ Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ A bi-criteria approach for the data association problem ⋮ Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ A survey for the quadratic assignment problem ⋮ Asymptotic behavior of the expected optimal value of the multidimensional assignment problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems ⋮ Computational Studies of Randomized Multidimensional Assignment Problems ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Implicit-Runge-Kutta-based methods for fast, precise, and scalable uncertainty propagation ⋮ Group target tracking via jointly optimizing group partition and association ⋮ Rank-1 tensor approximation for high-order association in multi-target tracking ⋮ On optimality of a polynomial algorithm for random linear multidimensional assignment problem ⋮ Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem ⋮ An LP-based algorithm for the data association problem in multitarget tracking. ⋮ Graph partitions for the multidimensional assignment problem ⋮ Three-index linear programs with nested structure ⋮ Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem ⋮ Dynamic discrete tomography ⋮ Multi-index transportation problems with 1-nested structure ⋮ Random assignment problems ⋮ Some assignment problems arising from multiple target tracking ⋮ Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem ⋮ Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Selected topics on assignment problems ⋮ Multi-index transport problems with decomposition structure ⋮ Matrix permanent inequalities for approximating joint assignment matrices in tracking systems ⋮ Solving the multidimensional assignment problem by a cross-entropy method ⋮ On multi-index assignment polytopes ⋮ Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems ⋮ Random multi-index matching problems ⋮ Tracking elementary particles near their primary vertex: A combinatorial approach ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors ⋮ Combinatorial optimization in system configuration design ⋮ Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Tracking and data association
- A forward/reverse auction algorithm for asymmetric assignment problems
- A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
- Application of 0-1 integer programming to multitarget tracking problems
This page was built for publication: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
