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.90594MaRDI QIDQ5938472
Publication date: 22 July 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Local search heuristics for the multidimensional assignment problem, Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem, Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems, A multi-objective model for environmental investment decision making, Some assignment problems arising from multiple target tracking, Branch and bound solution of the multidimensional assignment problem formulation of data association, Local Search Heuristics for the Multidimensional Assignment Problem