Asymptotic properties of random multidimensional assignment problems

The multidimensional assignment problem (MAP) is an NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made earlier 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.