A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
From MaRDI portal
Publication:5938472
DOI10.1023/A:1011285402433zbMath1168.90594OpenAlexW1565234356MaRDI QIDQ5938472
Publication date: 22 July 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011285402433
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (12)
Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ A multi-objective model for environmental investment decision making ⋮ Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ A nonmonotone GRASP ⋮ Some assignment problems arising from multiple target tracking ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ Local search heuristics for the multidimensional assignment problem ⋮ ROML: a robust feature correspondence approach for matching objects in a set of images ⋮ Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems ⋮ A dual approach to multi-dimensional assignment problems ⋮ Local Search Heuristics for the Multidimensional Assignment Problem
This page was built for publication: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
