Asymptotic behavior of the expected optimal value of the multidimensional assignment problem

The Multidimensional Assignment Problem (MAP) is a higher-dimensional version of the Linear Assignment Problem that arises in the areas of data association, target tracking, resource allocation, etc. This paper elucidates the question of asymptotical behavior of the expected optimal value of the large-scale MAP whose assignment costs are independent identically distributed random variables with a prescribed probability distribution. We demonstrate that for a broad class of continuous distributions the limiting value of the expected optimal cost of the MAP is determined by the location of the left endpoint of the support set of the distribution, and construct asymptotical bounds for the expected optimal cost.

• Type: Journal
• Year: 2007
• Where: MP
• Authors: Pavlo A. Krokhmal, Don A. Grundel, Panos M. Pardalos
• Keywords: Assignment Problem, Linear Assignment Problem, MP 2007, Multidimensional Assignment Problem