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

Mathematical Programming

Volumn 109, Issue 2-3, 2007, Pages 525-551

  Krokhmal, Pavlo A ^a   Grundel, Don A ^b   Pardalos, Panos M ^c  

^a University of Iowa   (United States)

^b AIR FORCE RESEARCH LABORATORY   (United States)

^c UNIVERSITY OF FLORIDA   (United States)

Author keywords

Asymptotical analysis; Convergence bounds; Expected optimal value; Multidimensional assignment problem; Random assignment problem

Indexed keywords

ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; DATA REDUCTION; RANDOM PROCESSES; RESOURCE ALLOCATION; TRACKING (POSITION);

CONVERGENCE BOUNDS; EXPECTED OPTIMAL VALUES; MULTIDIMENSIONAL ASSIGNMENT PROBLEMS; RANDOM ASSIGNMENT PROBLEMS;

PROBLEM SOLVING;

EID: 33846701761     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0036-x     Document Type: Conference Paper

References (39)

1. Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: GRASP with path relinking for three-index assignment. INFORMS J. Comput. 17(2), 224-247 (2005)
2. Aldous, D.: Asymptotics in the random assignment problem. Prob. Theory Relat. Fields 93, 507-534 (1992)
3. Aldous, D.: The ζ(2) limit in the random assignment problem. Random Struct. Algorithms 18(4), 381-418 (2001)
4. Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)
5. Andrijich, S.M., Caccetta, L.: Solving the multisensor data association problem. Nonlinear Anal. 47, 5525-5536 (2001)
6. Balas, E., Saltzman, M.J.: An algorithm for the three-index assignment problem. Oper. Res. 39, 150-161. (1991.)
7. Barndorff-Nielsen, O.: On the limit behaviour of extreme order statistics. Ann. Math. Stat. 34(3), 992-1002 (1963)
8. Burkard, R.E.: Selected topics on assignment problems. Discrete Appl. Math. 123, 257-302 (2002)
9. Burkard, R.E., Çela, E.: Linear assignment problems and extensions. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 4. Kluwer Dordrecht (1999)
10. Burkard, R.E., Çela, E.: Quadratic and three-dimensional assignments. In: Dellć6Amico, M., MaQoli, F., Martello, S., (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 373-391. Wiley, Chichester (1999)
11. 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)
12. David, H.A., Nagaraja, H.N.: Order Statistics, 3rd edn. Wiley, New York (2000)
13. Erdélyi, A. (ed.): Higher Transcendental Functions, vol. 1. McGraw-Hill Book Company, New York (1953)
14. Erdélyi, A.: General asymptotic expansions of laplace integrals. Arch. Ration. Mech. Anal. 7, 1-20 (1961.)
15. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco (1997)
16. Goemans, M.X., Kodilian, M.: A lower bound on the expected value of an optimal assignment. Math. Oper. Res. 18, 267-274 (1993)
17. 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)
18. Grundel, D.A., Oliveira, C.A.S., Pardalos, P.M.: Asymptotic properties of random multidimensional assignment problems. J. Optim. Theory Appl. 122(3), 487-500 (2004)
19. Karp, R.M.: An upper bound on the expected cost of an optimal assignment, pp. 1-4. Aca., Boston (1987)
20. Lazarus, A.J.: Certain expected values in the random assignment problem. Tech. Rep., Math. & Computer Science Dept., University of California, Riverside (1990)
21. Lazarus, A.J.: Certain expected values in the random assignment problem. Oper. Res. Lett. 14, 207-214 (1993)
22. Linusson, S., Wästlund, J.: A proof of Parisi's conjecture on the random assignment problem. Prob. Theory Related Fields 128(3), 419-440 (2004)
23. Mézard, M., Parisi, G.: Replicas and optimization. J. Phys. Lett. 46(17), 771-778 (1985)
24. 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)
25. 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)
26. Nair, C., Prabhakar, B., Sharma, M.: Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Struct. Algorithms 27(4), 413-444 (2005)
27. Olin, B.: Asymptotic properties of the random assignment problem. PhD thesis, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden (1992)
28. Olver, F.W.: Asymptotics and Special Functions, 2nd edn. AK Peters Ltd, Wellesley, (1997)
29. Papadimitrou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)
30. Pardalos, P.M., Ramakrishnan, K.G.: On the expected optimal value of random assignment problems: Experimental results and open questions. Comput. Optim. Appl. 2, 261-271 (1993)
31. Parisi, G.: A conjecture on random bipartite matching. Physics e-Print archive (1998). http://xxx.lang.gov/ps/cond-mat/9801176
32. Pasiliao, E.L.: Algorithms for multidimensional assignment problems. PhD thesis, Department of Industrial and Systems Engineering, University of Florida (2003)
33. Pierskalla, W.: The multidimensional assignment problem. Oper. Res. 16, 422-431 (1968)
34. Poore, A.B.: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Comput. Optim. Appl. 3, 27-54 (1994)
35. Poore, A.B.: 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, pp. 339-361. Kluwer Dordrecht (1994)
36. Pusztaszeri, J.F., Rensing, P.E., Liebling, T.M.: Tracking elementary particles near their primary vertex: a combinatorial approach. J. Global Optim. 9(1), 41-64 (1996)
37. 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)
38. Walkup, D.W.: On the expected value of a random assignment problem. SIAM J. Comput. 8, 440-442 (1979)
39. Wolfram Research, Inc. http://functions.wolfram.com