Vogiatzis, Chrysafis; Pasiliao, Eduardo; Pardalos, Panos - In: Computational Optimization and Applications 58 (2014) 1, pp. 205-224
Multidimensional Assignment Problem (MAP). The problem is defined as finding n disjoint cliques of size m with minimum total cost in K … <Subscript> m×n </Subscript>, which is an m-partite graph with n elements per dimension. Even though the 2-dimensional assignment … problem is solvable in polynomial time, extending the problem to include n≥3 dimensions renders it <InlineEquation ID="IEq1 …