Random assignment problems

European Journal of Operational Research

Volumn 194, Issue 1, 2009, Pages 1-17

  Krokhmal, Pavlo A ^a   Pardalos, Panos M ^b  

^a UNIVERSITY OF IOWA   (United States)

^b University of Florida   (United States)

Author keywords

Asymptotic analysis; Bottleneck assignment problem; Fitness landscape analysis; Linear assignment problem; Multidimensional assignment problem; Probabilistic analysis; Quadratic assignment problem; Random assignment problems

Indexed keywords

ASYMPTOTIC ANALYSIS; COMPUTER SCIENCE; PROBABILITY; QUADRATIC PROGRAMMING; RANDOM PROCESSES; TRAVELING SALESMAN PROBLEM;

BOTTLENECK ASSIGNMENT PROBLEM; FITNESS LANDSCAPE ANALYSIS; LINEAR ASSIGNMENT PROBLEM; MULTIDIMENSIONAL ASSIGNMENT PROBLEM; PROBABILISTIC ANALYSIS; QUADRATIC ASSIGNMENT PROBLEM; RANDOM ASSIGNMENT PROBLEMS;

PROBLEM SOLVING;

EID: 54049089331     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.11.062     Document Type: Article

References (107)

1. Aiex R.M., Resende M.G.C., Pardalos P.M., and Toraldo G. GRASP with path relinking for three-index assignment. INFORMS Journal on Computing 17 2 (2005) 224-247
2. Albrecher H. A note on the asymptotic behaviour of bottleneck problems. Operations Research Letters 33 2 (2005) 183-186
3. Albrecher H., Burkard R.E., and Çela E. An asymptotical study of combinatorial optimization problems by means of statistical mechanics. Journal of Computational and Applied Mathematics 186 1 (2006) 148-162
4. Aldous D. Asymptotics in the random assignment problem. Probability Theory and Related Fields 93 4 (1992) 507-534
5. Aldous D. The ζ (2) limit in the random assignment problem. Random Structures and Algorithms 18 4 (2001) 381-418
6. Alm S.E., and Sorkin G.B. Exact expectations and distributions for the random assignment problem. Combinatorics, Probability & Computing 11 3 (2002) 217-248
7. Andrijich S.M., and Caccetta L. Solving the multisensor data association problem. Nonlinear Analysis 47 8 (2001) 5525-5536
8. Angel E., and Zissimopoulos V. On the quality of local search for the quadratic assignment problem. Discrete Applied Mathematics 82 1 (1998) 15-25
9. Angel E., and Zissimopoulos V. On the landscape ruggedness of the quadratic assignment problem. Theoretical Computer Science 263 1-2 (2001) 159-172
10. Anstreicher K.M. Recent advances in the solution of quadratic assignment problems. Mathematical Programming 97 1-2 (2003) 27-42
11. Avis D., and Devroye L. An analysis of a decomposition heuristic for the assignment problem. Operations Research Letters 3 6 (1985) 279-283
12. Avis D., and Lai C.W. The probabilistic analysis of a heuristic for the assignment problem. SIAM Journal on Computing 17 4 (1988) 732-741
13. Balas E., and Randweer P.R. Traffic assignment in communications satellites. Operations Research Letters 2 4 (1983) 141-147
14. Balas E., and Saltzman M.J. An algorithm for the three-index assignment problem. Operations Research 39 1 (1991) 150-161
15. Bonomi E., and Lutton J. The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach. European Journal of Operational Research 26 2 (1986) 295-300
16. Brogan W.L. Algorithm for ranked assignments with applications to multiobject tracking. Journal of Guidance, Control, and Dynamics 12 3 (1989) 357-364
17. Buck M.W., Chan C.S., and Robbins D.P. On the expected value of the minimum assignment. Random Structures & Algorithms 21 1 (2002) 33-58
18. Burkard R.E. Quadratische bottleneck probleme. Operations Research Verfahren 18 1 (1974) 26-41
19. Burkard R.E. Quadratic assignment problems. European Journal of Operational Research 15 3 (1984) 283-289
20. Burkard R.E. Time-slot assignment for tdma systems. Computing 35 2 (1985) 99-112
21. Burkard R.E. Selected topics on assignment problems. Discrete Applied Mathematics 123 1-3 (2002) 257-302
22. Burkard R.E., and Çela E. Heuristics for biquadratic assignment problems and their computational comparison. European Journal of Operational Research 83 2 (1995) 283-300
23. Burkard R.E., and Çela E. Linear assignment problems and extensions. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization vol. A (Suppl.) (1999), Kluwer Academic Publishers, Dordrecht 75-149
24. Burkard R.E., and Fincke U. The asymptotic probabilistic behavior of quadratic sum assignment problems. Zeitschrift für Operations Research 27 (1982) 73-81
25. Burkard R.E., and Fincke U. On random quadratic bottleneck assignment problems. Mathematical Programming 23 2 (1982) 227-232
26. Burkard R.E., and Fincke U. Probabilistic asymptotic properties of some combinatorial optimization problems. Discrete Applied Mathematics 12 1 (1985) 21-29
27. Burkard R.E., Hahn W., and Zimmermann U. An algebraic approach to assignment problems. Mathematical Programming 12 3 (1977) 318-327
28. Burkard R.E., Karisch S., and Rendl F. Qaplib - A quadratic assignment problem library. European Journal of Operational Research 55 1 (1991) 115-119
29. Burkard R.E., Çela E., and Klinz B. On the biquadratic assignment problem. In: Pardalos P.M., and Wolkowicz H. (Eds). Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 16 (1994), American Mathematical Society, Providence, RI 117-146
30. Burkard R.E., Çela E., and Woeginger G.J. A minimax assignment problem in treelike communication networks. European Journal of Operational Research 87 3 (1995) 670-684
31. Burkard R.E., Çela E., and Dudás T. A communication assignment problem on trees: Heuristics and asymptotic behaviour. In: Pardalos P.M., Hearn D.W., and Hager W.W. (Eds). Network Optimization. Lecture Notes in Economical and Mathematical Systems vol. 450 (1997), Springer, Berlin 127-155
32. Burkard R.E., Çela E., Pardalos P.M., and Pitsoulis L. The quadratic assignment problem. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization vol. 3 (1998), Kluwer Academic Publishers 241-339
33. Carraresi P., and Gallo G. A multi-level bottleneck assignment approach to the bus drivers' rostering problem. European Journal of Operational Research 16 2 (1984) 163-173
34. Çela E. The Quadratic Assignment Problem: Theory and Algorithms (1998), Kluwer Academic Publishers, Dordrecht
35. Coppersmith D., and Sorkin G. Constructive bounds and exact expectations for the random assignment problem. Random Structures and Algorithms 15 2 (1999) 113-144
36. Donath W.E. Algorithm and average-value bounds for assignment problems. IBM Journal of Research and Development (1969) 380-386
37. Dotsenko V. Introduction to the Replica Theory of Disordered Statistical Systems (2001), Cambridge University Press, Cambridge
38. Dyer M.E., and Frieze A.M. On patching algorithms for random asymmetric travelling salesman problems. Mathematical Programming 46 1-3 (1990) 361-378
39. Dyer M.E., Frieze A.M., and McDiarmid C.J.H. On linear programs with random costs. Mathematical Programming 35 1 (1986) 3-16
40. Frenk J.B.G., van Houweninge M., and Rinnooy Kan A.H.G. Asymptotic properties of the quadratic assignment problem. Mathematics of Operations Research 10 1 (1985) 100-116
41. Frenk J.B.G., van Houweninge M., and Rinnooy Kan A.H.G. Order statistics and the linear assignment problem. Computing 39 2 (1987) 165-174
42. Frieze A., and Sorkin G.B. The probabilistic relationship between the assignment and asymmetric traveling salesman problems. SIAM Journal on Computing 36 5 (2007) 1435-1452
43. Fulkerson, R., Glickberg, I., Gross, O., 1953. A production line assignment problem. Tech. Rep. RM-1102, The RAND Corporation, Sta. Monica, CA.
44. Gabow H.N., and Tarjan R.E. Algorithms for two bottleneck assignment problems. Journal of Algorithms 9 3 (1988) 411-417
45. Goemans M.X., and Kodialam M.S. A lower bound on the expected value of an optimal assignment. Mathematics of Operations Research 18 2 (1993) 267-274
46. Grundel D.A., Oliveira C.A.S., and Pardalos P.M. Asymptotic properties of random multidimensional assignment problems. Journal of Optimization Theory and Applications 122 3 (2004) 487-500
47. Grundel D.A., Krokhmal P.A., Oliveira C.A.S., and Pardalos P.M. On the average case behavior of the multidimensional assignment problem. Pacific Journal of Optimization 1 1 (2005) 39-57
48. Grundel D.A., Oliveira C.A.S., Pardalos P.M., and Pasiliao E.L. Asymptotic results for random multidimensional assignment problems. Computational Optimization and Applications 31 3 (2005) 275-293
49. Grundel D., Krokhmal P., Oliveira C., and Pardalos P. On the number of local minima in the multidimensional assignment problem. Journal of Combinatorial Optimization 13 1 (2007) 1-18
50. Jones T., and Forrest S. Fitness distance correlation as a measure of problem dificulty for genetic algorithms. In: Eshleman L.J. (Ed). Proceedings of the Sixth International Conference on Genetic Algorithms (1995), Morgan Kaufmann, San Francisco, CA 184-192
51. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
52. Karp R.M. A patching algorithm for the nonsymmetric traveling salesman problem. SIAM Journal on Computing 8 4 (1979) 561-573
53. Karp R.M. An algorithm to solve the m × n assignment problem in expected time O (mn log n). Networks 10 2 (1980) 143-152
54. Karp R.M. An upper bound on the expected cost of an optimal assignment. In: Johnson D.S., Nishizeki T., Nozaki A., and Wilf H.S. (Eds). Discrete Algorithms and Complexity. Perspectives in Computing vol. 15 (1987), Academic Press, Boston 1-4
55. Karp R.M., and Steele J.M. Probabilistic analysis of heuristics. In: Lawler E.W., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. (Eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985), Wiley, New York 181-206
56. Karp R.M., Rinnooy Kan A.H.G., and Vohra R.V. Average case analysis of a heuristic for the assignment problem. Mathematics of Operations Research 19 3 (1994) 143-152
57. Kellerer H., and Wirsching G. Bottleneck quadratic assignment problems and the bandwidth problem. Asia-Pacific Journal of Operational Research 15 2 (1998) 169-177
58. Koopmans T.C., and Beckmann M.J. Assignment problems and the location of economic activities. Econometrica 25 1 (1957) 52-76
59. Krokhmal P., Grundel D., and Pardalos P. Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Mathematical Programming 109 2-3 (2007) 525-551
60. Kuhn H.W. The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2 1-2 (1955) 83-87
61. Kurtzberg J.M. On approximation methods for the assignment problem. Journal of the ACM 9 4 (1962) 419-439
62. Lazarus A.J. Certain expected values in the random assignment problem. Operations Research Letters 14 4 (1993) 207-214
63. Li Y., and Pardalos P.M. Generating quadratic assignment test problems with known optimal permutations. Computational Optimization and Applications 1 2 (1992) 163-184
64. Linusson, S., Wästlund, J., 2000. A generalization of the random assignment problem. arXiv:math.CO/0006146.
65. Linusson S., and Wästlund J. A proof of Parisi's conjecture on the random assignment problem. Probability Theory and Related Fields 128 3 (2004) 419-440
66. Loiola E.A., Maia de Abreu N.M., Boaventura-Netto P.O., Hahn P.M., and Querido T. A survey for the quadratic assignment problem. European Journal of Operational Research 176 2 (2007) 657-690
67. Martin O.C., Mézard M., and Rivoire O. Random multi-index matching problems. Journal of Statistical Mechanics (2005) P09006
68. Merz P., and Freisleben B. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4 4 (2000) 337-352
69. Mézard M., and Parisi G. Replicas and optimization. Journal de Physique Lettres 46 17 (1985) 771-778
70. Mézard M., Parisi G., and Virasoro M.A. Spin Glass Theory and Beyond (1987), World Scientific, Singapore
71. Murphey R., Pardalos P., and Pitsoulis L. A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: Pardalos P.M., and Du D.-Z. (Eds). Network Design: Connectivity and Facilities Location. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 40 (1998), American Mathematical Society 277-302
72. Nair, C., 2005. Proofs of the Parisi and Coppersmith-Sorkin conjectures in the random assignment problem. Ph.D. Thesis, Stanford University.
73. Nair C., Prabhakar B., and Sharma M. Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Structures & Algorithms 27 4 (2005) 413-444
74. Olin, B., 1992. Asymptotic properties of the random assignment problem. Ph.D. Thesis, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden.
75. Palmer R. Optimization on rugged landscapes. In: Perelson A., and Kauffman S. (Eds). Molecular Evolution on Rugged Ladscapes: Proteins, RNA, and the Immune System (1991), Addison Wesley, Redwood City, CA 3-26
76. In: Pardalos P.M., and Pitsoulis L. (Eds). Nonlinear Assignment Problems: Algorithms and Applications (2000), Kluwer Academic Publishers
77. Pardalos P.M., and Ramakrishnan K.G. On the expected optimal value of random assignment problems: Experimental results and open questions. Computational Optimization and Applications 2 3 (1993) 261-271
78. In: Pardalos P.M., and Wolkowicz H. (Eds). Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 16 (1994), American Mathematical Society, Providence, RI
79. Parisi, G., 1998. A conjecture on random bipartite matching. arXiv:cond-mat/9801176v1, URL: http://arxiv.org/pdf/cond-mat/9801176.
80. Parviainen R. Random assignment with integer costs. Combinatorics, Probability & Computing 13 1 (2004) 103-113
81. Pasiliao, E.L., 2003. Algorithms for multidimensional assignment problems. Ph.D. Thesis, Department of Industrial and Systems Engineering, University of Florida.
82. Pentico D.W. Assignment problems: A golden anniversary survey. European Journal of Operational Research 176 2 (2007) 774-793
83. Pferschy U. The random linear bottleneck assignment problem. RAIRO - Operations Research 30 2 (1996) 127-142
84. Pierskalla W. The multidimensional assignment problem. Operations Research 16 2 (1968) 422-431
85. Poore A.B. Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Computational Optimization and Applications 3 1 (1994) 27-54
86. Pusztaszeri J.F., Rensing P.E., and Liebling T.M. Tracking elementary particles near their primary vertex: A combinatorial approach. Journal of Global Optimization 9 1 (1996) 41-64
87. Rhee W.T. A note on asymptotic properties of the quadratic assignment problem. Operations Research Letters 7 4 (1988) 197-200
88. Rhee W.T. Stochastic analysis of the quadratic assignment problem. Mathematics of Operations Research 16 2 (1991) 223-239
89. Sahni T., and Gonzales T. P-complete approximation problems. Journal of the Association for Computing Machinery 23 3 (1976) 555-565
90. Serfling R. Approximation Theorems for Mathematical Statistics (1980), Wiley, New York
91. Slepian D. The one-sided barrier problem for gaussian noise. Bell System Technical Journal 41 2 (1962) 463-501
92. Stadler P.F. Landscapes and their correlation functions. Journal of Mathematical Chemistry 20 1 (1996) 1-45
93. Steinberg L. The backboard wiring problem: A placement algorithm. SIAM Review 3 1 (1961) 37-50
94. Stützle T., and Hoos H.H. MAX s(-) MIN ant system. Future Generation Computer Systems 16 8 (2000) 889-914
95. Szpankowski W. Combinatorial optimization problems for which almost every algorithm is asymptotically optimal!. Optimization 33 4 (1995) 359-367
96. Taillard E.D. Comparison of iterative searches for the quadratic assignment problem. Location Science 3 2 (1995) 87-105
97. Talagrand M. Concentration of measure and isoperimetric inequalities in product spaces vol. 81 (1995), Institut Hautes Études Scientifiques Publications Mathématiques pp. 73-205
98. Tong Y.L. The Multivariate Normal Distribution (1990), Springer Verlag, Berlin
99. Veenman, C.J., Hendriks, E.A., Reinders, M.J.T., 1998. A fast and robust point tracking algorithm. In: Proceedings of the Fifth IEEE International Conference on Image Processing, Chicago, pp. 653-657.
100. Vollmann T.E., and Buffa E.S. The facilities layout problem in perspective. Management Science 12 10 (1966) 450-468
101. Walkup D.W. On the expected value of a random assignment problem. SIAM Journal on Computation 8 3 (1979) 440-442
102. Walkup D.W. Matchings in random regular bipartite digraphs. Discrete Mathematics 31 1 (1980) 59-64
103. Wästlund J. A proof of a conjecture of buck, chan, and robbins on the expected value of the minimum assignment. Random Structures and Algorithms 26 1-2 (2005) 237-251
104. Wästlund, J., 2005b. A simple proof of the Parisi and Coppersmith-Sorkin formulas for the random assignment problem. Linköping Studies in Mathematics (6). URL: http://www.ep.liu.se/ea/lsm/2005/006/.
105. Wästlund, J., 2005c. The variance and higher moments in the random assignment problem. Linköping Studies in Mathematics (8). URL: http://www.ep.liu.se/ea/lsm/2005/008/.
106. Wästlund, J., 2006. Random assignment and shortest path problems. In: Proceedings of the Fourth Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities. Institut Élie Cartan, Nancy, France (September). URL: http://www.mai.liu.se/jowas/dmtcsPath.pdf.
107. Weinberger E.D. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics 63 5 (1990) 325-336