Abstract
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 m×n , 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 \(\mathcal{NP}\)-hard. We propose two novel decomposition schemes for partitioning a MAP into disjoint subproblems, that can then be recombined to provide both upper and lower bounds to the original problem. For each of the partitioning schemes, we investigate and compare the efficiency of distinct exact and heuristic methodologies, namely augmentation and partitioning. Computational results for the methods, along with a hybrid one that consists of both partitioning schemes, are presented to depict the success of our approaches on large-scale instances.
Similar content being viewed by others
References
Aiex, R., Resende, M., Pardalos, P., Toraldo, G.: Grasp with path relinking for the three-index assignment problem. INFORMS J. Comput. (2000)
Andrijich, S.M., Caccetta, L.: Solving the multisensor data association problem. Nonlinear Anal. 47(8), 5525–5536 (2001)
Bandelt, H.J., Crama, Y., Spieksma, F.C.: Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discrete Appl. Math. 49(1), 25–50 (1994)
Bar-Shalom, Y., Chummun, M.R., Kirubarajan, T., Pattipati, K.R.: Fast data association for multisensor-multitarget tracking using clustering and multidimensional assignment algorithms. IEEE Trans. Aerosp. Electron. Syst. 37(3), 898–913 (2001)
Blackman, S.S.: Multiple-target tracking with radar applications. Artech House, Inc. (1986)
Burkard, R.E., Çela, E.: Quadratic and three-dimensional assignment problems: an annotated bibliography. In: DellíAmico, M., Maffioli, F., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 373–392. Wiley, New York (1997)
Burkard, R.E., Çela, E.: Linear assignment problems and extensions. In: Du, D., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 75–149. Kluwer Academic, Norwell (1999)
Çela, E.: Assignment problems. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 661–678. Oxford University Press, New York (2002)
Gilbert, K., Hofstra, R.: Multidimensional assignment models. Decis. Sci. 19, 306–321 (1988)
Grundel, D., Pardalos, P.: Test problem generator for the multidimensional assignment problem. Comput. Optim. Appl. 30(2), 133–146 (2005)
Larsen, M.: Branch and bound solution of the multidimensional assignment problem formulation of data association. Optim. Methods Softw. 27(6), 1101–1126 (2012)
Oliveira, C., Pardalos, P.: Randomized parallel algorithms for the multidimensional assignment problem. Appl. Numer. Math. 49(1), 117–133 (2004)
Pardalos, P.M., Pitsoulis, L.S. (eds.): Nonlinear Assignment Problems: Algorithms and Applications. Combinatorial Optimization, vol. 7. Kluwer Academic, Dordrecht (2000)
Pasiliao, E.: Algorithms for multidimensional assignment problems. Ph.D. thesis, University of Florida (2003)
Pasiliao, E.: Local neighborhoods for the multidimensional assignment problem. In: Dynamics of Information Systems, pp. 353–371 (2010)
Pasiliao, E., Pardalos, P., Pitsoulis, L.: Branch and bound algorithms for the multidimensional assignment problem. Optim. Methods Softw. 20(1), 127–143 (2005)
Pierskalla, W.P.: Letter to the editor—the multidimensional assignment problem. Oper. Res. 16(2), 422–431 (1968)
Pitsoulis, L.S., Resende, M.G.C.: Greedy randomized adaptive search procedures. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 168–183. Oxford University Press, New York (2002)
Poore, A.: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Comput. Optim. Appl. 3(1), 27–57 (1994)
Poore, A.B., Robertson III, A.J.: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems. Comput. Optim. Appl. 8, 129–150 (1997)
Spieksma, F.C.R.: Multi index assignment problems: complexity, approximation, applications. In: Pardalos, P.M., Pitsoulis, L.S. (eds.) Nonlinear Assignment Problems: Algorithms and Applications. Combinatorial Optimization, vol. 7, pp. 1–12. Kluwer Academic, Dordrecht (2000)
Acknowledgement
This research was supported by the AFRL Mathematical Modeling and Optimization Institute.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Vogiatzis, C., Pasiliao, E.L. & Pardalos, P.M. Graph partitions for the multidimensional assignment problem. Comput Optim Appl 58, 205–224 (2014). https://doi.org/10.1007/s10589-013-9619-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-013-9619-7