Asymptotic Properties of Random Multidimensional Assignment Problems

The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in Ref. 1 and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when assignment costs are independent exponentially or uniformly distributed random variables. We prove also that the mean optimal solution goes to negative infinity when assignment costs are independent normally distributed random variables.

[1]  William P. Pierskalla,et al.  Letter to the Editor - The Multidimensional Assignment Problem , 1968, Oper. Res..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  R. Karp.  An Upper Bound on the Expected Cost of an Optimal Assignment , 1987 .

[4]  D. Aldous.  Asymptotics in the random assignment problem , 1992 .

[5]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[6]  Panos M. Pardalos,et al.  On the expected optimal value of random assignment problems: Experimental results and open questions , 1993, Comput. Optim. Appl..

[7]  Thomas M. Liebling,et al.  Tracking elementary particles near their primary vertex: A combinatorial approach , 1996, J. Glob. Optim..

[8]  Panos M. Pardalos,et al.  A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem , 1997, Network Design: Connectivity and Facilities Location.

[9]  Cor J. Veenman,et al.  A fast and robust point tracking algorithm , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[10]  Don Coppersmith,et al.  Constructive bounds and exact expectations for the random assignment problem , 1998, Random Struct. Algorithms.

[11]  D. Coppersmith,et al.  Constructive bounds and exact expectation for the random assignment problem , 1999 .

[12]  Rainer E. Burkard,et al.  Linear Assignment Problems and Extensions , 1999, Handbook of Combinatorial Optimization.

[13]  Panos M. Pardalos,et al.  Nonlinear assignment problems : algorithms and applications , 2000 .

[14]  Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization) , 2000 .

[15]  Sharlene M. Andrijich,et al.  Solving the multisensor data association problem , 2001 .

[16]  D. Coppersmith,et al.  On the expected incremental cost of a minimum assignment , 2002 .

[17]  Panos M. Pardalos,et al.  Asymptotic Results for Random Multidimensional Assignment Problems , 2005, Comput. Optim. Appl..