A parallel grasp for the data association multidimensional assignment problem
From MaRDI portal
Recommendations
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
- Randomized parallel algorithms for the multidimensional assignment problem
- scientific article; zbMATH DE number 1163720
- scientific article; zbMATH DE number 934533
- Distributed- and shared-memory parallelizations of assignment-based data association for multitarget tracking
Cited in
(11)- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Distributed- and shared-memory parallelizations of assignment-based data association for multitarget tracking
- Randomized parallel algorithms for the multidimensional assignment problem
- Multidimensional assignment problem for multipartite entity resolution
- Integer programming models for the multidimensional assignment problem with star costs
- Branch and bound solution of the multidimensional assignment problem formulation of data association
- scientific article; zbMATH DE number 1163720 (Why is no real title available?)
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- Selected topics on assignment problems
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
This page was built for publication: A parallel grasp for the data association multidimensional assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251080)
