A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking

DOI10.1137/0803027zbMath0799.90092OpenAlexW1990546837MaRDI QIDQ3140003

Nenad Rijavec, Aubrey B. Poore

Publication date: 6 December 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803027

zbMATH Keywords

data associationmultidimensional assignmentmultitarget trackingrecursive Lagrangian relaxation algorithm

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ An LP-based algorithm for the data association problem in multitarget tracking. ⋮ Dynamic discrete tomography ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ Solving the multidimensional assignment problem by a cross-entropy method ⋮ Test problem generator for the multidimensional assignment problem ⋮ A dual approach to multi-dimensional assignment problems ⋮ Tracking elementary particles near their primary vertex: A combinatorial approach ⋮ Combinatorial optimization in system configuration design ⋮ Geometric three-dimensional assignment problems ⋮ Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

This page was built for publication: A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking