A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems

DOI10.1023/A:1008669120497zbMath0887.90143OpenAlexW2008285373MaRDI QIDQ1366299

Alexander J. III Robertson, Aubrey B. Poore

Publication date: 25 May 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008669120497

zbMATH Keywords

nonsmooth optimizationmultiple target trackingdata associationmultidimensional assignmentconstructive Lagrangian relaxationnoisy objective function

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonsmooth analysis (49J52) Combinatorial optimization (90C27)

Related Items (13)

Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ A survey for the quadratic assignment problem ⋮ Branch and bound algorithms for the multidimensional assignment problem ⋮ On optimality of a polynomial algorithm for random linear multidimensional assignment problem ⋮ Graph partitions for the multidimensional assignment problem ⋮ Some assignment problems arising from multiple target tracking ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Selected topics on assignment problems ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ Solving the multidimensional assignment problem by a cross-entropy method ⋮ On multi-index assignment polytopes ⋮ ROML: a robust feature correspondence approach for matching objects in a set of images ⋮ A dual approach to multi-dimensional assignment problems

This page was built for publication: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems