Some assignment problems arising from multiple target tracking
From MaRDI portal
Publication:2473184
DOI10.1016/j.mcm.2005.05.026zbMath1171.90450OpenAlexW2000814501MaRDI QIDQ2473184
Sabino Gadaleta, Aubrey B. Poore
Publication date: 26 February 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2005.05.026
target trackingmultiple hypothesis trackingmulti-dimensional assignmentgroup assignmentmultiple hypothesis correlation
Search theory (90B40) Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Related Items
Branch and bound solution of the multidimensional assignment problem formulation of data association, A study on two measurements-to-tracks data assignment algorithms, Efficient sensor network management for asset localization, Facets of the axial three-index assignment polytope, Linear regression with sparsely permuted data, Dynamic discrete tomography, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, A dual approach to multi-dimensional assignment problems, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
- THE GROUP ASSIGNMENT PROBLEM ARISING IN MULTIPLE TARGET TRACKING
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem