Branch and bound solution of the multidimensional assignment problem formulation of data association

DOI10.1080/10556788.2011.648931zbMath1248.65063MaRDI QIDQ2905350

Morten Holm Larsen

Publication date: 27 August 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.648931

zbMATH Keywords

numerical examples; branch and bound algorithm; multidimensional assignment problem; data association problem

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B80: Discrete location and assignment

Related Items

Efficient sensor network management for asset localization, Integer programming models for the multidimensional assignment problem with star costs, Graph partitions for the multidimensional assignment problem

Cites Work

• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• 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
• A genetic algorithm based multi-dimensional data association algorithm for multi-sensor-multi-target tracking
• An LP-based algorithm for the data association problem in multitarget tracking.
• Randomized parallel algorithms for the multidimensional assignment problem
• Solving the multisensor data association problem.
• Some assignment problems arising from multiple target tracking
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
• Local Search Heuristics for the Multidimensional Assignment Problem
• Branch and bound algorithms for the multidimensional assignment problem
• Letter to the Editor—The Multidimensional Assignment Problem
• A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem