Selected topics on assignment problems

Discrete Applied Mathematics

Volumn 123, Issue 1-3, 2002, Pages 257-302

  Burkard, Rainer E ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Assignment problem; Asymptotic theory; Biquadratic assignment problem; Bottleneck assignment problem; Communication assignment problem; Multidimensional assignment problem; Quadratic assignment problem; Quadratic bottleneck assignment problem; Special cases

Indexed keywords

ASYMPTOTIC ANALYSIS;

ASSIGNMENT PROBLEMS; ASYMPTOTIC THEORIES; BOTTLENECK ASSIGNMENT PROBLEM; MULTIDIMENSIONAL ASSIGNMENT PROBLEM; QUADRATIC ASSIGNMENT PROBLEMS;

COMBINATORIAL OPTIMIZATION;

EID: 84867995355     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00343-2     Document Type: Article

References (154)

1. W.P. Adams, and T.A. Johnson Improved linear programming-based lower bounds for the quadratic assignment problem P.M. Pardalos, H. Wolkowicz, Quadratic Assignment and Related Problems DIMACS Series on Discrete Mathematics and Theoretical Computer Science Vol. 16 1994 AMS Providence, RI 43 75
2. W.P. Adams, and H.D. Sherali A tight linearization and an algorithm for zero-one quadratic programming problems Management Sci. 32 1986 1274 1290
3. W.P. Adams, and H.D. Sherali Linearization strategies for a class of zero-one mixed integer programming problems Oper. Res. 38 1990 217 226
4. R.K. Ahuja, J.B. Orlin, and A. Tivari A descent genetic algorithm for the quadratic assignment problem Computers and Operations Research 27 2000 917 934
5. H. Alt, N. Blum, K. Mehlhorn, and M. Paul Computing maximum cardinality matching in time O(n 1.5 m/ log n) Inform. Process. Lett. 37 1991 237 240
6. S. Arora, A. Frieze, H. Kaplan, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1996, pp. 21-30.
7. A.A. Assad, and W. Xu On lower bounds for a class of quadratic 0-1 programs Oper. Res. Lett. 4 1985 175 180
8. E. Balas, and P.R. Landweer Traffic assignment in communications satellites Oper. Res. Lett. 2 1983 141 147
9. E. Balas, and L. Qi Linear-time separation algorithms for the three-index assignment polytope Discrete Appl. Math. 43 1993 1 12
10. E. Balas, and M.J. Saltzman Facets of the three-index assignment polytope Discrete Appl. Math. 23 1989 201 229
11. E. Balas, and M.J. Saltzman An algorithm for the three-index assignment problem Oper. Res. 39 1991 150 161
12. S.E. Bammel, and J. Rothstein The number of 9×9 Latin squares Discrete Math. 11 1975 93 95
13. A.I. Barvinok Computational complexity of orbits in representations of symmetric groups Adv. Soviet Math. 9 1992 161 182
14. R. Battiti, and G. Tecchiolli The reactive tabu search ORSA J. Comput. 6 1994 126 140
15. G. Birkhoff Tres observaciones sobre el algebra lineal Rev. univ. nac. Tucumán (A) 5 1946 147 151
16. W.L. Brogan Algorithm for ranked assignments with applications to multiobject tracking J. Guidance 12 1989 357 364
17. R.E. Burkard Die Störungsmethode zur Lösung quadratischer Zuordnungsprobleme Oper. Res. Verfahren 16 1973 84 108
18. R.E. Burkard Quadratische Bottleneckprobleme Oper. Res. Verfahren 18 1974 26 41
19. R.E. Burkard Time-slot assignment for TDMA-systems Computing 35 1985 99 112
20. R.E. Burkard Locations with spatial interactions: the quadratic assignment problem P.B. Mirchandani, R.L. Francis, Discrete Location Theory 1991 Wiley New York 387 437
21. R.E. Burkard, and E. Çela Heuristics for biquadratic assignment problems and their computational comparison European J. Oper. Res. 83 1995 283 300
22. R.E. Burkard, and E. Çela Quadratic and three-dimensional assignments M. Dell'Amico, F. Maffioli, S. Martello, Annotated Bibliographies in Combinatorial Optimization 1997 Wiley Chichester 373 391
23. R.E. Burkard, E. Çela, An asymptotical study of combinatorial optimization problems by means of statistical mechanics. SFB Report 133, Institute of Mathematics, Technical University Graz, Austria, 1998.
24. R.E. Burkard, and E. Çela Linear assignment problems and extensions D.-Z. Du, P.M. Pardalos, Handbook of Combinatorial Optimization, Vol. 4 1999 Kluwer Academic Publishers Dordrecht
25. R.E. Burkard, E. Çela, and T. Dudás A communication assignment problem on trees: heuristics and asymptotic behaviour P.M. Pardalos, D.W. Hearn, W.W. Hager, Network Optimization Lecture Notes in Economics and Mathematical Systems Vol. 450 1997 Springer Berlin 127 155
26. R.E. Burkard, E. Çela, V.M. Demidenko, N.N. Metelski, G.J. Woeginger, Perspectives of easy and hard cases of the quadratic assignment problems, SFB Report 104, Institute of Mathematics, Technical University Graz, Austria, 1997.
27. R.E. Burkard, E. Çela, and B. Klinz On the biquadratic assignment problem P.M. Pardalos, H. Wolkowicz, Quadratic Assignment and Related Problems DIMACS Series on Discrete Mathematics and Theoretical Computer Science Vol. 16 1994 AMS Providence, RI 117 146
28. R.E. Burkard, E. Çela, P. Pardalos, and L.S. Pitsoulis The quadratic assignment problem D.-Z. Du, P.M. Pardalos, Handbook of Combinatorial Optimization, Vol. 3 1998 Kluwer Academic Publishers Dordrecht 241 339
29. R.E. Burkard, E. Çela, G. Rote, and G.J. Woeginger The quadratic assignment problem with an Anti-Monge and a Toeplitz matrix: easy and hard cases Math. Programming 82 1998 125 158
30. R.E. Burkard, E. Çela, and G.J. Woeginger A minimax assignment problem in treelike communication networks European J. Oper. Res. 87 1995 670 684
31. R.E. Burkard, and U. Derigs Assignment and Matching Problems: Solution Methods with FORTRAN Programs 1980 Springer Berlin
32. R.E. Burkard, and U. Fincke On random quadratic bottleneck assignment problems Math. Programming 23 1982 227 232
33. R.E. Burkard, and U. Fincke The asymptotic probabilistic behavior of the quadratic sum assignment problem Z. Oper. Res. 27 1983 73 81
34. R.E. Burkard, and U. Fincke Probabilistic asymptotic properties of some combinatorial optimization problems Discrete Appl. Math. 12 1985 21 29
35. R.E. Burkard, and K. Fröhlich Some remarks on 3-dimensional assignment problems Methods of Oper. Res. 36 1980 31 36
36. R.E. Burkard, W. Hahn, and U. Zimmermann An algebraic approach to assignment problems Math. Programming 12 1977 318 327
37. R.E. Burkard, S.E. Karisch, F. Rendl, QAPLIB - a quadratic assignment problem library, J. Global Optim. 10 (1997) 391-403. An on-line version is available via World Wide Web at the following URL: http://www.opt.math.tu-graz. ac.at/~karisch/qaplib/
38. R.E. Burkard, B. Klinz, and R. Rudolf Perspectives of Monge properties in optimization Discrete Appl. Math. 70 1996 95 161
39. R.E. Burkard, J. Offermann, Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme, Z. Oper. Res. 21 (1977) B121-B132 (in German).
40. R.E. Burkard, and F. Rendl A thermodynamically motivated simulation procedure for combinatorial optimization problems European J. Oper. Res. 17 1984 169 174
41. R.E. Burkard, and R. Rudolf Computational investigations on 3-dimensional axial assignment problems Belgian J. Oper. Res. 32 1993 85 98
42. R.E. Burkard, R. Rudolf, and G.J. Woeginger Three dimensional axial assignment problems with decomposable cost coefficients Discrete Appl. Math. 65 1996 123 169
43. R.E. Burkard, and U. Zimmermann Weakly admissible transformations for solving algebraic assignment and transportation problems Math. Programming Study 12 1980 1 18
44. R.E. Burkard, and U. Zimmermann Combinatorial optimization in linearly ordered semimodules: a survey B. Korte, Modern Applied Mathematics 1982 North-Holland Amsterdam 392 436
45. G. Carpaneto, and P. Toth Algorithm for the solution of the bottleneck assignment problem Computing 27 1981 179 187
46. P. Carraresi, and F. Malucelli A reformulation scheme and new lower bounds for the QAP P. Pardalos, H. Wolkowicz, Quadratic Assignment and Related Problems DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 16 1994 AMS Providence, RI 147 160
47. E. Çela The Quadratic Assignment Problem: Theory and Algorithms 1998 Kluwer Academic Publishers Dordrecht, The Netherlands
48. V. Čern Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm J. Optim. Theory Appl. 45 1985 41 51
49. J. Chakrapani, and J. Skorin-Kapov Massively parallel tabu search for the quadratic assignment problem Ann. Oper. Res. 41 1993 327 342
50. J. Clausen, S.E. Karisch, M. Perregaard, and F. Rendl On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel Comput. Optim. Appl. 10 1998 127 147
51. D.T. Connolly An improved annealing scheme for the QAP European J. Oper. Res. 46 1990 93 100
52. K. Conrad Das Quadratische Zuweisungsproblem und zwei seiner Spezialfälle 1971 Mohr-Siebeck Tübingen
53. D. Coppersmith, and S. Vinograd Matrix multiplication via arithmetic progressions J. Symbolic Comput. 9 1990 251 280
54. V.G. Deneko, V.L. Filonenko, On the reconstruction of specially structured matrices, Aktualnyje Problemy EVM i Programmirovanije, Dnjepropetrovsk, DGU, 1979 (1990) 251-280 (in Russian).
55. V.G. Deneko, and G.J. Woeginger A solvable case of the quadratic assignment problem Oper. Res. Lett. 22 1998 13 17
56. M. Dell'Amico, and S. Martello Linear Assignment M. Dell'Amico, F. Maffioli, S. Martello, Annotated Bibliographies in Combinatorial Optimization 1997 Wiley Chichester 355 371
57. U. Derigs Alternate strategies for solving bottleneck assignment problems - analysis and computational results Computing 33 1984 95 106
58. U. Derigs, O. Goecke, and R. Schrader Monge sequences and a simple assignment algorithm Discrete Appl. Math. 15 1986 241 248
59. U. Derigs, and U. Zimmermann An augmenting path method for solving linear bottleneck assignment problems Computing 19 1978 285 295
60. J.W. Dickey, and J.W. Hopkins Campus building arrangement using TOPAZ Transportation Res. 6 1972 59 68
61. W.E. Donath Algorithms and average-value bounds for assignment problems IBM J. Res. Develop. 13 1969 380 386
62. M.E. Dyer, A.M. Frieze, and C.J.H. McDiarmid On linear programs with random costs Math. Programming 35 1986 3 16
63. J. Edmonds, and D.R. Fulkerson Bottleneck extrema J. Combin. Theory 8 1970 299 306
64. C.S. Edwards A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem Math. Programming Stud. 13 1980 35 52
65. R. Euler Odd cycles and a class of facets of the axial 3-index assignment polytope Applicationes Math. (Zastowania Matematyki) 19 1987 375 386
66. R. Euler, R.E. Burkard, and R. Grommes On Latin squares and the facial structure of related polytopes Discrete Math. 62 1986 155 181
67. R. Euler, and H. Le Verge Time-tables, polyhedra and the greedy algorithm Discrete Appl. Math. 65 1996 207 221
68. G. Finke, R.E. Burkard, and F. Rendl Quadratic assignment problems Ann. Discrete Math. 31 1987 61 82
69. L.R. Ford, and D.R. Fulkerson Maximal flow through a network Canad. J. Math. 8 1956 399 404
70. J.B.G. Frenk, M. van Houweninge, and A.H.G. Rinnooy Kan Asymptotic properties of the quadratic assignment problem Math. Oper. Res. 10 1985 100 116
71. A.M. Frieze Complexity of a 3-dimensional assignment problem European J. Oper. Res. 13 1983 161 164
72. A.M. Frieze, and L. Yadegar An algorithm for solving 3-dimensional assignment problems with application to scheduling in a teaching practice J. Oper. Res. Soc. 32 1981 989 995
73. A.M. Frieze, and J. Yadegar On the quadratic assignment problem Discrete Appl. Math. 5 1983 89 98
74. R. Fulkerson, I. Glicksberg, O. Gross, A production line assignment problem, Technical Report RM-1102, The Rand Corporation, Sta. Monica, CA, 1953.
75. H.N. Gabow, and R.E. Tarjan Algorithms for two bottleneck optimization problems J. Algorithms 9 1988 411 417
76. R. Garfinkel An improved algorithm for the bottleneck assignment problem Oper. Res. 19 1971 1747 1751
77. A.M. Geoffrion, and G.W. Graves Scheduling parallel production lines with changeover costs: Practical applications of a quadratic assignment/LP approach Oper. Res. 24 1976 595 610
78. O. Gross, The bottleneck assignment problem, Technical Report P-1630, The Rand Corporation, Sta. Monica, CA, 1959.
79. S.W. Hadley, F. Rendl, H. Wolkowicz, Bounds for the quadratic assignment problem using continuous optimization techniques, Proceedings of the First Integer Programming and Combinatorial Optimization Conference (IPCO), University of Waterloo Press, 1990, pp. 237-248.
80. S.W. Hadley, F. Rendl, and H. Wolkowicz A new lower bound via projection for the quadratic assignment problem Math. Oper. Res. 17 1992 727 739
81. S.W. Hadley, F. Rendl, and H. Wolkowicz Nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality Linear Algebra Appl. 58 1992 109 124
82. P. Hahn, and T. Grant Lower bounds for the quadratic assignment problem based upon a dual formulation Oper. Res. 46 1998 912 922
83. Ph. Hall On representatives of subsets J. London Math. Soc. 10 1935 26 30
84. P. Hansen, and L. Kaufman A primal-dual algorithm for the three-dimensional assignment problem Cahiers du CERO 15 1973 327 336
85. G.H. Hardy, J.E. Littlewood, and G. Pólya Inequalities 1952 Cambridge University Press London
86. D.R. Heffley Assigning runners to a relay team S.P. Ladany, R.E. Machol, Optimal Strategies in Sports 1977 North-Holland Amsterdam 169 171
87. A.J. Hoffman On simple linear programming problems V. Klee, Convexity, Proceedings of Symposia in Pure Mathematics, Vol. 7 1963 AMS Providence, RI 317 327
88. 5/2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2 1973 225 231
89. M. Jünger, and V. Kaibel The QAP polytope and the star transformation Discr. Appl. Math. 111 2001 283 306
90. M. Jünger, and V. Kaibel On the SQAP polytope SIAM J. Optim. 11 2000 444 463
91. V. Kaibel, Polyhedral Combinatorics of the Quadratic Assignment Problem, Ph.D. Thesis, Universität zu Köln, Germany, 1997.
92. S.E. Karisch, E. Çela, J. Clausen, and T. Espersen A dual framework for lower bounds of the quadratic assignment problem based on linearization Computing 63 1999 351 403
93. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of Computer Computations 1972 Plenum Press New York 85 103
94. R.M. Karp An algorithm to solve the m×n assignment problem in expected time O(mn log n) Networks 10 1980 143 152
95. R.M. Karp An upper bound on the expected cost of an optimal assignment D.S. Johnson, T. Nishizeki, A. Nozaki, H.S. Wilf, Perspectives in Computing, Vol. 15 1987 Academic Press Boston 1 4
96. R.M. Karp, A.H.G. Rinnooy Kan, and R.V. Vohra Average case analysis of a heuristic for the assignment problem Math. Oper. Res. 19 1994 513 522
97. L. Kaufman, and F. Broeckx An algorithm for the quadratic assignment problem using Benders' decomposition European J. Oper. Res. 2 1978 204 211
98. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 1983 671 680
99. D. König Graphok és matrixok Mat. Fiz. Lapok 38 1931 116 119
100. T.C. Koopmans, and M.J. Beckmann Assignment problems and the location of economic activities Econometrica 25 1957 53 76
101. J. Krarup, and P.M. Pruzan Computer-aided layout design Math. Programming Study 9 1978 75 94
102. G. Laporte, and H. Mercure Balancing hydraulic turbine runners: a quadratic assignment problem European J. Oper. Res. 35 1988 378 382
103. E.L. Lawler The quadratic assignment problem Management Sci. 9 1963 586 599
104. A.J. Lazarus Certain expected values in the random assignment problem Oper. Res. Lett. 14 1993 207 214
105. Y. Lee, and J.B. Orlin On very large scale assignment problems W.W. Hager, D.W. Hearn, P.M. Pardalos, Large Scale Optimization: State of the Art 1994 Kluwer Academic Publishers Dordrecht, The Netherlands 206 244
106. J.L. Lewandowski, J.W.S. Liu, and C.L. Liu SS/TDMA time slot assignment with restricted switching modes IEEE Trans. Comm. COM-31 1983 149 154
107. Y. Li, and P.M. Pardalos Generating quadratic assignment test problems with known optimal permutations Comput. Optim. Appl. 1 1992 163 184
108. D. Magos Tabu search for the planar three-index assignment problem J. Global Optim. 8 1996 35 48
109. D. Magos, and P. Miliotis An algorithm for the planar three-index assignment problem European J. Oper. Res. 77 1994 141 153
110. S. Martello, W.R. Pulleyblank, P. Toth, and D. de Werra Balanced optimization problems Oper. Res. Lett. 3 1984 275 278
111. A. Marzetta, A. Brüngger, A dynamic programming bound for the quadratic assignment problem, in: Computing and Combinatorics: Fifth Annual International Conference COCOON'99, Lecture Notes in Computer Science, Vol. 1627, Springer, Heidelberg, 1999, pp. 339-348.
112. E.J. McCormick Human Factors Engineering 1970 McGraw-Hill New York
113. M. Mézard, and G. Parisi On the solution of the random link matching problems J. Phys. 48 1987 1451 1459
114. J. Mosevich Balancing hydraulic turbine runners - a discrete combinatorial optimization problem European J. Oper. Res. 26 1986 202 204
115. K. Mulmuley, U.V. Vazirani, and V.V. Vazirani Matching is as easy as matrix inversion Combinatorica 7 1987 105 113
116. R. Murphey, P.M. Pardalos, and L.S. Pitsoulis A GRASP for the multitarget multisensor tracking problem P.M. Pardalos, D.-Z. Du, Network Design: Connectivity and Facilities Location DIMACS Series on Discrete Mathematics and Theoretical Computer Science Vol. 40 1998 AMS Providence, RI 277 302
117. R. Murphey, P.M. Pardalos, L.S. Pitsoulis, 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, Springer, Berlin, 1998, pp. 159-180.
118. K.A. Murthy, P. Pardalos, and Y. Li A local search algorithm for the quadratic assignment problem Informatica 3 1992 524 538
119. B. Neng Zur Erstellung von optimalen Triebfahrzeugplänen Z. Oper. Res. 25 1981 B159 B185
120. B. Olin, Asymptotic Properties of Random Assignment Problems, Ph.D. Thesis, Division of Optimization and Systems Theory, Department of Mathematics, Royal Institute of Technology, Stockholm, 1992.
121. M.W. Padberg, and M.P. Rijal Location, Scheduling, Design and Integer Programming 1996 Kluwer Academic Publishers Boston
122. E.S. Page A note on assignment problems Comput. J. 6 1963 241 243
123. C.H. Papadimitriou, D. Wolfe, The complexity of facets resolved, Proceedings of the 25th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 1985, pp. 74-78.
124. P.M. Pardalos, F. Rendl, and H. Wolkowicz The quadratic assignment problem: a survey and recent developments P.M. Pardalos, H. Wolkowicz, Quadratic Assignment and Related Problems DIMACS Series on Discrete Mathematics and Theoretical Computer Science Vol. 16 1994 AMS Providence, RI 1 42
125. U. Pferschy The random linear bottleneck assignment problem RAIRO Oper. Res. 30 1996 127 142
126. U. Pferschy Solution methods and computational investigations for the linear bottleneck assignment problem Computing 59 1997 237 258
127. W.P. Pierskalla The multidimensional assignment problem Oper. Res. 16 1968 422 431
128. A.B. Poore Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking Comput. Optim. Appl. 3 1994 27 54
129. A.B. Poore A numerical study of some data association problems arising in multitarget tracking W.W. Hager, D.W. Hearn, P.M. Pardalos, Large Scale Optimization: State of the Art 1994 Kluwer Academic Publishers Dordrecht, The Netherlands 339 361
130. A.B. Poore, and N. Rijavec Partitioning multiple data sets: multidimensional assignments and Lagrangian relaxation P.M. Pardalos, H. Wolkowicz, Quadratic Assignment and Related Problems DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 16 1994 AMS Providence, RI 317 342
131. A.B. Poore, N. Rijavec, M. Liggins, and V. Vannicola Data association problems posed as multidimensional assignment problems: problem formulation O.E. Drummond, Signal and Data Processing of Small Targets 1993 SPIE Bellingham, WA 552 561
132. A.B. Poore, and A.J. Robertson III A new Lagrangean relaxation based algorithm for a class of multidimensional assignment problems Comput. Optim. Appl. 8 1997 129 150
133. A.P. Punnen, and K.P.K. Nair Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem Discrete Appl. Math. 55 1994 91 93
134. J. Pusztaszeri, P.E. Rensing, and T.M. Liebling Tracking elementary particles near their primary vertex: a combinatorial approach J. Global Optim. 16 1995 422 431
135. L. Qi, E. Balas, and G. Gwan A new facet class and a polyhedral method for the three-index assignment problem D.-Z. Du, Advances in Optimization 1994 Kluwer Academic Publishers Dordrecht 256 274
136. M. Queyranne Performance ratio of heuristics for triangle inequality quadratic assignment problems Oper. Res. Lett. 4 1986 231 234
137. F. Rendl On the complexity of decomposing matrices arising in satellite communication Oper. Res. Lett. 4 1985 5 8
138. F. Rendl, and H. Wolkowicz Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem Math. Programming 53 1992 63 78
139. W.T. Rhee Stochastic analysis of the quadratic assignment problem Math. Oper. Res. 16 1991 223 239
140. C. Roucairol A reduction method for quadratic assignment problems Oper. Res. Verfahren 32 1979 183 187
141. S. Sahni, and T. Gonzalez P-complete approximation problems J. Assoc. Comput. Mach. 23 1976 555 565
142. J.T. Schwarz Fast probabilistic algorithms for verification of polynomial identities J. ACM 27 1980 701 717
143. J. Skorin-Kapov Tabu search applied to the quadratic assignment problem ORSA J. Comput. 2 1990 33 45
144. W. Szpankowski Combinatorial optimization problems for which almost every algorithm is asymptotically optimal! Optimization 33 1995 359 367
145. L. Steinberg The backboard wiring problem: a placement algorithm SIAM Rev. 3 1961 37 50
146. E. Taillard Robust tabu search for the quadratic assignment problem Parallel Comput. 17 1991 443 455
147. R.E. Tarjan Data Structures and Network Algorithms 1983 SIAM Philadelphia, PA
148. W.T. Tutte The factorization of linear graphs J. London Math. Soc. 22 1947 107 111
149. I. Ugi, J. Bauer, J. Friedrich, J. Gasteiger, C. Jochum, and W. Schubert Neue Anwendungsgebiete für Computer in der Chemie Angew. Chem. 91 1979 99 111
150. M. Vlach Branch and bound method for the three-index assignment problem Ekonom.-Mat. Obzor 12 1967 181 191
151. D.W. Walkup On the expected value of a random assignment problem SIAM J. Comput. 8 1979 440 442
152. D.W. Walkup Matching in random regular bipartite digraphs Discrete Math. 31 1980 59 64
153. M.R. Wilhelm, and T.L. Ward Solving quadratic assignment problems by simulated annealing IEEE Trans. 19 1987 107 119
154. Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz Semidefinite relaxations for the quadratic assignment problem J. Combin. Optim. 2 1998 71 109