Vogiatzis, Chrysafis; Pasiliao, Eduardo; Pardalos, Panos - In: Computational Optimization and Applications 58 (2014) 1, pp. 205-224

In this paper, we consider two decomposition schemes for the graph theoretical description of the axial 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...</subscript>