Asymptotic properties of random multidimensional assignment problems

Journal of Optimization Theory and Applications

Volumn 122, Issue 3, 2004, Pages 487-500

  Grundel, D A ^a   Oliveira, C A S ^b   Pardalos, P M ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

asymptotic results; combinatorial optimization; Multidimensional assignment problem

Indexed keywords

COSTS; NORMAL DISTRIBUTION; RANDOM VARIABLES;

ASYMPTOTIC PROPERTIES; ASYMPTOTIC RESULTS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENT; DATA ASSOCIATION; DISTRIBUTED RANDOM VARIABLES; MULTIDIMENSIONAL ASSIGNMENT PROBLEM; NP-HARD; OBJECTIVE FUNCTIONS; RANDOM INSTANCE;

COMBINATORIAL OPTIMIZATION;

EID: 4844231430     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOTA.0000042592.16418.1b     Document Type: Article

References (17)

1. GRUNDEL, D. A., OLIVEIRA, C. A. S., PARDALOS, P. M., and PASILIAO, E., Asymptotic Results for Random Multidimensional Assignment Problems, Technical Report, Industrial and Systems Engineering Department, University of Florida, Gainesville, Florida, 2003.
2. GAREY, M. R., and JOHNSON, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, California, 1979.
3. PIERSKALLA, W., The Multidimensional Assignment Problem. Operations Research, Vol. 16, pp. 422-431, 1968.
4. PARDALOS, P., MURPHEY, R., and PITSOULIS, L., A Greedy Randomized Adaptive Search Procedure for the Multitarget Multisensor Tracking Problem, Network Design: Connectivity and Facility Location, Edited by D.Z. Du and P. Pardalos, Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, Rhode Island, Vol 40, pp. 277-302, 1997.
5. ANDRIJICH, S. M., and CACCETTA, L., Solving the Multisensor Data Association Problem, Nonlinear Analysis, Vol. 47, pp. 5525-5536, 2001.
6. VEENMAN, C., HENDRIKS, E., and REINDERS, M., A Fast and Robust Point Tracking Algorithm, Proceedings of the 5th IEEE International Conference on Image Processing, Chicago, Illinois, pp. 653-657, 1998.
7. PUSZTASZERI, J., RENSING, P., and LIEBLING, T., Tracking Elementary Particles Near Their Primary Vertex: A Combinatorial Approach, Journal of Global Optimization, Vol. 9, pp. 41-64, 1996.
8. PARDALOS, P., and PITSOULIS, L., Editors, Nonlinear Assignment: Problems, Algorithms, and Applications, Kluwer, Dordrecht, Holland, 2000.
9. ALDOUS, D., Asymptotics in the Random Assignment Problem, Probability Theory and Related Fields, Vol. 93, pp. 507-534, 1992.
10. COPPERSMITH, D., and SORKIN, G., Constructive Bounds and Exact Expectations for the Random Assignment Problem, Random Structures and Algorithms, Vol. 15, pp. 133-144, 1999.
11. COPPERSMITH, D., and SORKIN, G., On the Expected Incremental Cost of a Minimum Assignment, Technical Report, T.J. Watson IBM Research Center, 1999.
12. KARP, R., An Upper Bound on the Expected Cost of an Optimal Assignment, Discrete Algorithms and Complexity: Proceedings of the Japan-US Joint Seminar, Edited by D. Johnson et al, Academic Press, New York, NY, pp. 1-4, 1987.
13. PARDALOS, P., and RAMAKRISHNAN, K., On the Expected Optimal Value of Random Assignment Problems: Experimental Results and Open Questions, Computational Optimization and Applications, Vol. 2, pp. 261-271, 1993.
14. ALON, N., and SPENCER, J., The Probabilistic Method, 2nd Edition, Interscience Series in Discrete Mathematics and Optimization, John Wiley, New York, NY, 2000.
15. DAVID, H., Order Statistics, John Wiley and Sons, New York, NY, 1970.
16. CRAMÉR, H., Mathematical Methods of Statistics. Princeton University Press, Princeton, New Jersey, 1957.
17. BURKARD, R. E., and ÇELA, E., Linear Assignment Problems and Extensions, Handbook of Combinatorial Optimization, Supplement Volume A, Edited by D.Z. Du and P.M. Pardalos, Kluwer Academic Publishers, Dordrecht, Holland, pp. 75-149, 1999.