A new class of Heuristic Polynomial Time Algorithms to solve the Multidimensional Assignment Problem.

Federico Perea Huub W. de Waard

Published in: FUSION (2006)

Keyphrases

computational complexity
data structure
computational cost
hill climbing
computationally tractable
finding an optimal solution
dynamic programming
worst case
multi dimensional
mathematical programming
exhaustive search
heuristic methods
approximate solutions
exact algorithms
greedy heuristic