Abstract
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.
Similar content being viewed by others
References
Aiex R.M., Resende M.G.C., Pardalos P.M., Toraldo G. (2005) GRASP with path relinking for three-index assignment. INFORMS J. Comput. 17(2): 224–247
Aldous D. (1992) Asymptotics in the random assignment problem. Prob. Theory Relat. Fields 93, 507–534
Aldous D. (2001) The ζ(2) limit in the random assignment problem. Random Struct. Algorithms 18(4): 381–418
Alon N., Spencer J. (2000) The Probabilistic Method, 2nd edn. Wiley, New York
Andrijich S.M., Caccetta L. (2001) Solving the multisensor data association problem. Nonlinear Anal. 47, 5525–5536
Balas E., Saltzman M.J. (1991) An algorithm for the three-index assignment problem. Oper. Res. 39, 150–161
Barndorff-Nielsen O. (1963) On the limit behaviour of extreme order statistics. Ann. Math. Stat. 34(3): 992–1002
Burkard R.E. (2002) Selected topics on assignment problems. Discrete Appl. Math. 123, 257–302
Burkard R.E., Ç;ela E. (1999). Linear assignment problems and extensions. In: Du D.Z., Pardalos P.M. (eds). Handbook of Combinatorial Optimization, vol. 4. Kluwer, Dordrecht
Burkard R.E., Çela E. (1999). Quadratic and three-dimensional assignments. In: DellAmico M., MaQoli F., Martello S., (eds). Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, pp. 373–391
Clemons, W., Grundel, D., Jeffcoat, D. Applying simulated annealing on the multidimensional assignment problem. In: Proceedings of the International Conference on Cooperative Control and Optimization. Gainesville, (2003)
David H.A., Nagaraja H.N. (2000) Order Statistics, 3rd edn. Wiley, New York
Erdélyi A. ed. (1953) Higher Transcendental Functions, vol. 1. McGraw-Hill Book Company, New York
Erdélyi A. (1961) General asymptotic expansions of laplace integrals. Arch. Ration. Mech. Anal. 7, 1–20
Garey M.R., Johnson D.S. (1997) Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco
Goemans M.X., Kodilian M. (1993) A lower bound on the expected value of an optimal assignment. Math. Oper. Res. 18, 267–274
Grundel, D.A., Krokhmal, P.A., Oliveira, C.A.S., Pardalos, P.M. On the number of local minima in the multidimensional assignment problem. Tech. Rep. 2004-8, Department of Industrial and Systems Engineering, University of Florida (2004)
Grundel D.A., Oliveira C.A.S., Pardalos P.M. (2004) Asymptotic properties of random multidimensional assignment problems. J. Optim. Theory Appl. 122(3): 487–500
Karp, R.M. An upper bound on the expected cost of an optimal assignment, pp. 1–4. Aca., Boston (1987)
Lazarus A.J. (1990) Certain expected values in the random assignment problem. Tech. Rep., Math. & Computer Science Dept., University of California, Riverside
Lazarus A.J. (1993) Certain expected values in the random assignment problem. Oper. Res. Lett. 14, 207–214
Linusson S., Wästlund J. (2004) A proof of Parisi’s conjecture on the random assignment problem. Prob. Theory Related Fields 128(3): 419–440
Mézard M., Parisi G. (1985) Replicas and optimization. J. Phys. Lett. 46(17): 771–778
Murphey, R., Pardalos, P., Pitsoulis, L. A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: DIMACS Series, vol. 40, pp. 277–302. American Mathematical Society, New york (1998)
Murphey, R., Pardalos, P., Pitsoulis, L. A parallel GRASP for the data association multidimensional assignment problem. In: Parallel Processing of Discrete Problems, The IMA Volumes in Mathematics and its Applications, vol. 106, pp. 159–180. Springer, Berlin Heidelberg New york (1998)
Nair C., Prabhakar B., Sharma M. (2005) Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Struct. Algorithms 27(4): 413–444
Olin B. (1992) Asymptotic properties of the random assignment problem. PhD thesis, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden
Olver F.W. (1997) Asymptotics and Special Functions, 2nd edn. AK Peters Ltd, Wellesley
Papadimitrou C.H., Steiglitz K. (1998) Combinatorial Optimization: Algorithms and Complexity. Dover, New York
Pardalos P.M., Ramakrishnan K.G. (1993) On the expected optimal value of random assignment problems: Experimental results and open questions. Comput. Optim. Appl. 2, 261–271
Parisi, G. A conjecture on random bipartite matching. Physics e-Print archive (1998). http://xxx.lang.gov/ps/cond-mat/9801176
Pasiliao, E.L. Algorithms for multidimensional assignment problems. PhD thesis, Department of Industrial and Systems Engineering, University of Florida (2003)
Pierskalla W. (1968) The multidimensional assignment problem. Oper. Res. 16, 422–431
Poore A.B. (1994) Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Comput. Optim. Appl. 3, 27–54
Poore A.B. (1994). A numerical study of some data association problems arising in multitarget tracking. In: Hager W.W., Hearn D.W., Pardalos P.M. (eds). Large Scale Optimization: State of the Art. Kluwer, Dordrecht, pp. 339–361
Pusztaszeri J.F., Rensing P.E., Liebling T.M. (1996) Tracking elementary particles near their primary vertex: a combinatorial approach. J. Global Optim. 9(1): 41–64
Veenman, C.J., Hendriks, E.A., Reinders, M.J.T. A fast and robust point tracking algorithm. In: Proceedings of the Fifth IEEE International Conference on Image Processing, pp. 653–657. Chicago (1998)
Walkup D.W. (1979) On the expected value of a random assignment problem. SIAM J. Comput. 8, 440–442
Wolfram Research, Inc. http://functions.wolfram.com
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by NSF grant DMI-0457473.
Rights and permissions
About this article
Cite this article
Krokhmal, P.A., Grundel, D.A. & Pardalos, P.M. Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Math. Program. 109, 525–551 (2007). https://doi.org/10.1007/s10107-006-0036-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0036-x