Quadratic assignment problems

Handbook of Combinatorial Optimization

Volumn 5-5, Issue , 2013, Pages 2741-2814

  Burkard, Rainer E ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; GENETIC ALGORITHMS; INTEGER PROGRAMMING; SIMULATED ANNEALING; TABU SEARCH;

BOUNDING PROCEDURES; BRANCH-AND-BOUND APPROACHES; COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRUCTION HEURISTICS; GRAPH PARTITIONING; INTEGER LINEAR PROGRAMS; QUADRATIC ASSIGNMENT PROBLEMS; SEMI-DEFINITE PROGRAMMING;

TRAVELING SALESMAN PROBLEM;

EID: 85027461917     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4419-7997-1_22     Document Type: Chapter

References (229)

1. E.H.L. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (Wiley, Chichester, 1989)
2. E. Aarts, J.K. Lenstra (eds.), Local Search in Combinatorial Optimization (Wiley, Chichester, 1997)
3. W.P. Adams, M. Guignard, P.M. Hahn, W.L. Hightower, A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. 180, 983-996 (2007)
4. W.P. Adams, T.A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in Quadratic Assignment and Related Problems, ed. by P.M. Pardalos, H. Wolkowicz. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, 1994), pp. 43-75.
5. W.P. Adams, H.D. Sherali, A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32, 1274-1290 (1986)
6. W.P. Adams, H.D. Sherali, Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38, 217-226 (1990)
7. R.K. Ahuja, K.C. Jha, J.B. Orlin, D. Sharma, Very large-scale neighborhood search for the quadratic assignment problem. INFORMS J. Comput. 19, 646-657 (2007)
8. R.K. Ahuja, J.B. Orlin, A. Tivari, A greedy genetic algorithm for the quadratic assignment problem. Working paper 3826-95, Sloan School of Management, MIT, 1995.
9. H. Albrecher, A note on the asymptotic behaviour of bottleneck problems. Oper. Res. Lett. 33, 183-186 (2005)
10. H. Albrecher, R.E. Burkard, E. Çlela, An asymptotical study of combinatorial optimization problems by means of statistical mechanics. J. Comput. Appl. Math. 186, 148-162 (2006)
11. K.M. Anstreicher, Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem. SIAM J. Optim. 11, 254-265 (2000)
12. K.M. Anstreicher, Recent advances in the solution of quadratic assignment problems. Math. Program. 97, 27-42 (2003)
13. K.M. Anstreicher, N.W. Brixius, A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 89, 341-357 (2001)
14. K.M. Anstreicher, N.W. Brixius, J.P. Goux, J. Linderoth, Solving large quadratic assignment problems on computational grids. Math. Program. 91, 563-588 (2002)
15. E.M. Arkin, R. Hassin, M. Sviridenko, Approximating the maximum quadratic assignment problem. Inform. Process. Lett. 77, 13-16 (2001)
16. S. Arora, A. Frieze, H. Kaplan, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, in Proceedings of the 37-th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1996, pp. 21-30.
17. A.A. Assad, W. Xu, On lower bounds for a class of quadratic 0-1 programs. Oper. Res. Lett. 4, 175-180 (1985)
18. E. Balas, J.B. Mazzola, Nonlinear programming: I. Linearization techniques. Math. Program. 30, 1-21 (1984)
19. E. Balas, J.B. Mazzola, Nonlinear programming: II. Dominance relations and algorithms. Math. Program. 30, 22-45 (1984)
20. A.I. Barvinok, Computational complexity of orbits in representations of symmetric groups. Adv. Soviet Math. 9, 161-182 (1992)
21. R. Battiti, G. Tecchiolli, The reactive tabu search. ORSA J. Comput. 6, 126-140 (1994)
22. M. Bayat, M. Sedghi, Quadratic assignment problems, in Facility Location, ed. by R.Z. Farahani, M. Hekmatfar (Springer, Berlin, 2010), pp. 111-143.
23. M.S. Bazaraa, O. Kirca, Branch and bound based heuristics for solving the quadratic assignment problem. Naval Res. Logist. Q. 30, 287-304 (1983)
24. M.S. Bazaraa, H.D. Sherali, Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res. Logist. Q. 27, 29-41 (1980)
25. M.S. Bazaraa, H.D. Sherali, On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. J. Oper. Res. Soc. 33, 991-1003 (1982)
26. A. Billionet, S. Elloumi, Best reduction of the quadratic semi-assignment problem. Discrete Appl. Math. 109, 197-213 (2001)
27. G. Birkhoff, Tres observaciones sobre el algebra lineal. Univ. Nac. Tucuman Rev. Ser. A, 5, 147-151 (1946)
28. A. Blanchard, S. Elloumi, A. Faye, M. Wicker, Un algorithme de generation de coupes pour le probleme de l'affectation quadratique. INFOR 41, 35-49 (2003)
29. S.H. Bokhari, A shortest tree algorithm for optimal assignments across space and time in a distributed processor system. IEEE Trans. Softw. Eng. 7, 583-589 (1981)
30. B. Bollobas, Extremal Graph Theory (Academic, London, 1978)
31. A.A. Bolotnikov, On the best balance of the disk with masses on its periphery. Problemi Mashinostroenia 6, 68-74 (1978) (in Russian)
32. E. Bonomi, J. Lutton, The asymptotic behavior of quadratic sum assignment problems: A statistical mechanics approach. Eur. J. Oper. Res. 26, 295-300 (1986)
33. A. Bruengger, J. Clausen, A. Marzetta, M. Perregaard, Joining forces in solving large-scale quadratic assignment problems in parallel, in Proceedings of the ll-th IEEE International Parallel Processing Symposium (IPPS), Geneva, Switzerland, 1997, pp. 418-427.
34. E.S. Buffa, G.C. Armour, T.E. Vollmann, Allocating facilities with CRAFT. Harv. Bus. Rev. 42, 136-158 (1962)
35. S. Burer, D. Vandebussche, Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16, 726-750 (2006)
36. R.E. Burkard, Die Storungsmethode zur Lösung quadratischer Zuordnungsprobleme. Oper. Res. Verfahren 16, 84-108 (1973)
37. R.E. Burkard, Quadratische Bottleneckprobleme. Oper. Res. Verfahren 18, 26-41 (1974)
38. R.E. Burkard, Locations with spatial interactions: the quadratic assignment problem, in Discrete Location Theory, ed. by P.B. Mirchandani, R.L. Francis (Wiley, 1991)
39. R.E. Burkard, Admissible transformations and assignment problems. Vietnam J. Math. 35, 373-386 (2007)
40. R.E. Burkard, T. Bönniger, A heuristic for quadratic boolean programs with applications to quadratic assignment problems. Eur. J. Oper. Res. 13, 374-386 (1983)
41. R.E. Burkard, E. Çela, Heuristics for biquadratic assignment problems and their computational comparison. Eur. J. Oper. Res. 83, 283-300 (1995)
42. 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.
43. R.E. Burkard, E. Çela, V.M. Demidenko, N.N. Metelski, G.J. Woeginger, A unified approach to simple special cases of extremal permutation. Optimization 44, 123-138 (1998)
44. R.E. Burkard, E. Çela, B. Klinz, On the biquadratic assignment problem, in Quadratic Assignment and Related Problems, ed. by P.M. Pardalos, H. Wolkowicz. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, 1994), pp. 117-146.
45. R.E. Burkard, E. Çela, G. Rote, G.J. Woeginger, The quadratic assignment problem with an Anti-Monge and a Toeplitz matrix: easy and hard cases. Math. Program. B 82, 125-158 (1998)
46. R.E. Burkard, M. Dell'Amico, S. Martello, Assignment Problems (SIAM, Philadelphia, 2009). ISBN 978-0-898716-63-4, revised reprint 2012, ISBN 978-1-611972-22-1.
47. R.E. Burkard, U. Derigs, Assignment and Matching Problems: Solution Methods with Fortran Programs. Lecture Notes in Economics and Mathematical Systems, vol. 184 (Springer, Berlin, 1980)
48. R.E. Burkard, U. Fincke, On random quadratic bottleneck assignment problems. Math. Program. 23, 227-232 (1982)
49. R.E. Burkard, U. Fincke, The asymptotic probabilistic behavior of the quadratic sum assignment problem. Z. Oper. Res. 27, 73-81 (1983)
50. R.E. Burkard, U. Fincke, Probabilistic asymptotic properties of some combinatorial optimization problems. Discrete Appl. Math. 12, 21-29 (1985)
51. R.E. Burkard, W. Hahn, U. Zimmermann, An algebraic approach to assignment problems. Math. Program. 12, 318-327 (1977)
52. R.E. Burkard, S.E. Karisch, F. Rendl, QAPLIB-a quadratic assignment problem library. J. Global Optim. 10, 391-403 (1997). An on-line version is available via World Wide Web at the following URL: http://www.seas.upenn.edu/qaplib/
53. R.E. Burkard, B. Klinz, R. Rudolf, Perspectives of Monge properties in optimization. Discrete Appl. Math. 70, 95-161 (1996)
54. R.E. Burkard, J. Offermann, Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Z. Oper. Res. 21, B121-B132 (1977) (in German)
55. R.E. Burkard, F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur. J. Oper. Res. 17, 169-174 (1984)
56. R.E. Burkard, R. Rissner, Polynomially solvable special cases of the quadratic bottleneck assignment problem. J. Combin. Optim. 22, 845-856 (2011)
57. R.E. Burkard, U. Zimmermann, Combinatorial optimization in linearly ordered semimodules: a survey, in Modern Applied Mathematics, ed. by B. Korte (North Holland, Amsterdam, 1982), pp. 392-436.
58. P. Carraresi, F. MaluceUi, A new lower bound for the quadratic assignment problem. Oper. Res. 40(Suppl. 1), S22-S27 (1992)
59. P. Carraresi, F. MaluceUi, A reformulation scheme and new lower bounds for the QAP, in Quadratic Assignment and Related Problems, ed. by P. Pardalos, H. Wolkowicz. DIMAJS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, RI, 1994), 147-160.
60. E. Çela, The Quadratic Assignment Problem: Theory and Algorithms (Kluwer Academic, Dordrecht, 1998)
61. E. Çela, N.S. Schmuck, S. Wimer, G.J. Woeginger, The Wiener maximum quadratic assignment problem. J. Discrete Optim. 8, 411-416 (2011)
62. V. Černý, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41-51 (1985)
63. J. Chakrapani, J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem. Ann. Oper. Res. 41, 327-342 (1993)
64. J. Chakrapani, J. Skorin-Kapov, A constructive method to improve lower bounds for the quadratic assignment problem, in Quadratic Assignment and Related Problems, ed. by P. Pardalos, H. Wolkowicz. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, 1994), pp. 161-171.
65. D. Chhajed, T.J. Lowe, m-Median and m-center problems with mutual communication: solvable special cases. Oper. Res. 40, S56-S66 (1992)
66. P. Chretienne, A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. Eur. J. Oper. Res. 43, 225-230 (1989)
67. N. Christofides, M. Gerrard, A graph theoretic analysis of bounds for the quadratic assignment problem, in Studies on Graphs and Discrete Programming, ed. by P. Hansen (North Holland, Amsterdam, 1981), pp. 61-68.
68. J. Clausen, S.E. Karisch, M. Perregaard, F. Rendl, On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel. Comput. Optim. Appl. 10, 127-147 (1998)
69. J. Clausen, M. Perregaard, Solving large quadratic assignment problems in parallel. Comput. Optim. Appl. 8, 111-127 (1997)
70. A. Colorni, M. Dorigo, V. Maniezzo, The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26, 29-41 (1996)
71. A. Colorni, V. Maniezzo, The ant system applied to the quadratic assignment problem. IEEE T Knowl. Data En. 11, 769-778 (1999)
72. D.T. Connolly, An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46, 93-100 (1990)
73. K. Conrad, Das Quadratische Zuweisungsproblem und zwei seiner Spezialfalle (MohrSiebeck, Tubingen, 1971)
74. D. Cyganski, R.F. Vaz, V.G. Virball, Quadratic assignment problems with the Palubeckis' algorithm are degenerate. IEEE Trans. Circ. Syst. I 41, 481-484 (1994)
75. J.R. Daduna, S. Voß, Practical experiences in schedule synchronization, in Computer-Aided Transit Schedule, ed. by J.R. Daduna, I. Branco, J.M. Pinto Paix ao. Lecture Notes in Economics and Mathematical Systems, vol. 430 (Springer, 1995), pp. 39-55.
76. L. Davis, Genetic Algorithms and Simulated Annealing (Pitman, London, 1987)
77. S.A. de Carvalho Jr., S. Rahmann, Microarray layout as a quadratic assignment problem, in Proceedings of the German Conference in Bioinformatics (GCB), ed. by D.H. Huson, O. Kohlbacher, A. Lupus, K. Nieselt, A. Zell. Lecture Notes in Computer Science, vol. P-38 (Springer, Berlin, 2006), pp. 11-20.
78. E. de Klerk, R. Sotirov, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program. 122, 225-246 (2010)
79. V.M. Demidenko, A. Dolgui, Efficiently solvable cases of the quadratic assignment problem with generalized monotonic and incomplete Anti-Monge matrices. Cybern. Syst. Anal. 43, 112-125 (2007)
80. V.M. Demidenko, G. Finke, V.S. Gordon, Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices. J. Math. Model. Algorithms 5, 167-187 (2006)
81. V.G. Deĭneko, G.J. Woeginger, A solvable case of the quadratic assignment problem. Oper. Res. Lett. 22, 13-17 (1998)
82. V.G. Deĭneko, G.J. Woeginger, A study of exponential neighborhoods for the travelling salesman problem and the quadratic assignment problem. Math. Program. Ser. A 87, 519542 (2000)
83. J.W. Dickey, J.W. Hopkins, Campus building arrangement using TOPAZ. Transp. Res. 6, 5968 (1972)
84. Y. Ding, H. Wolkowicz, A low dimensional semidefinite relaxation for the quadratic assignment problem. Math. Oper. Res. 34, 1008-1022 (2009)
85. A.A. Dobrynin, R. Entriger, I. Gutman, Wiener index of trees: theory and applications. Acta Appl. Math. 66, 211-249 (2001)
86. M. Dorigo, Optimization, learning, and natural algorithms. Ph.D. Thesis, Dipartimento die Elettronica e Informazione, Politecnico di Milano, Milano, Italy, 1992 (in Italian)
87. Z. Drezner, A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. 15, 320-330 (2003)
88. Z. Drezner, Compound genetic algorithms for the quadratic assignment problem. Oper. Res. Lett. 33, 475-480 (2005)
89. M.E. Dyer, A.M. Frieze, C.J.H. McDiarmid, On linear programs with random costs. Math. Program. 35, 3-16 (1986)
90. C.S. Edwards, The derivation of a greedy approximator for the Koopmans-Beckmann quadratic assignment problem, in Proceedings of the 77-th Combinatorial Programming Conference (CP77), Liverpool, 1977, pp. 55-86.
91. C.S. Edwards, A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem. Math. Program. Study 13, 35-52 (1980)
92. A.N. Elshafei, Hospital layout as a quadratic assignment problem. Oper. Res. Q. 28, 167-179 (1977)
93. R. Enkhbat, T. Javzandulam, A global search algorithm for the quadratic assignment problem. J. Mongolian Math. Soc. 4, 16-28 (2000)
94. G. Erdoğan, B. Tansel, A note on a polynomial time solvable case of the quadratic assignment problem. J. Discrete Optim. 3, 382-384 (2006)
95. G. Erdoğan, B. Tansel, A branch and cut algorithm for quadratic assignment problems based on linearizations. Comput. Oper. Res. 34, 1085-1106 (2007)
96. A. Faye, F. Roupin, A cutting plane algorithm based upon a semidefinite relaxation for the quadratic assignment problem, in Algorithms-ESA 2005, ed. by G.S. Brodal, S. Leonardi. Lecture Notes in Computer Science, vol. 3669 (Springer, Heidelberg, 2005), pp. 850-861.
97. T.A. Feo, M.G.C. Resende, Greedy randomized adaptive search procedures. J. Global Optim. 6, 109-133 (1995)
98. G. Finke, R.E. Burkard, F. Rendl, Quadratic assignment problems. Ann. Discrete Math. 31, 61-82 (1987)
99. M. Fischetti, M. Monaci, D. Salvagnin, Three ideas for the quadratic assignment problem. Oper. Res. 60, 954-964 (2012)
100. C. Fleurent, J. Ferland, Genetic hybrids for the quadratic assignment problem, in Quadratic Assignment and Related Problems, ed. by P. Pardalos, H. Wolkowicz. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, 1994), pp. 173-187.
101. J.B.G. Frenk, M. van Houweninge, A.H.G. Rinnooy Kan, Asymptotic properties of the quadratic assignment problem. Math. Oper. Res. 10, 100-116 (1985)
102. R.L. Freeman, D.C. Gogerty, G.W. Graves, R.B.S. Brooks, A mathematical model of supply for space operations. Oper. Res. 14, 1-15 (1966)
103. A.M. Frieze, J. Yadegar, On the quadratic assignment problem. Discrete Appl. Math. 5, 89-98 (1983)
104. A.M. Frieze, J. Yadegar, S. El-Horbaty, D. Parkinson, Algorithms for assignment problems on an array processor. Parallel Comput. 11, 151-162 (1989)
105. L.M. Gambardella, E.D. Taillard, M. Dorigo, Ant colonies for the QAP. J. Oper. Res. Soc. 50, 167-176 (1999)
106. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness (W.H. Freeman and Company, New York, 1979)
107. J.W. Gavett, N.V. Plyter, The optimal assignment of facilities to locations by branch and bound. Oper. Res. 14, 210-232 (1966)
108. A.M. Geoffrion, Lagrangean relaxation and its uses in integer programming. Math. Program. Study 2, 82-114 (1974)
109. A.M. Geoffrion, G.W. Graves, Scheduling parallel production lines with changeover costs: practical applications of a quadratic assignment/LP approach. Oper. Res. 24, 595-610 (1976)
110. P.C. Gilmore, Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J. Appl. Math. 10, 305-313 (1962)
111. F. Glover, Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22, 455-460 (1975)
112. F. Glover, Tabu search-Part I. ORSA J. Comput. 1, 190-206 (1989)
113. F. Glover, Tabu search-Part II. ORSA J. Comput. 2, 4-32 (1989)
114. F. Glover, Scatter search and path relinking, in New Ideas in Optimization, ed. by D. Corne, M. Dorigo, F. Glover, D. Dasgupta, P. Moscato, R. Poli, K.V. Price (McGraw Hill, Maidenhead, 1999), pp. 297-316.
115. F. Glover, M. Laguna, Tabu Search. (Kluwer Academic Publ., Norwell, 1997)
116. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145 (1995)
117. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison- Wesley, Wokingham, 1989)
118. G.W. Graves, A.B. Whinston, An algorithm for the quadratic assignment problem. Manag. Sci. 17, 453-471 (1970)
119. H. Greenberg, A quadratic assignment problem without column constraints. Naval Res. Logist. Q. 16, 417-422 (1969)
120. S.W. Hadley, Continuous optimization approaches for the quadratic assignment problem. PhD thesis, University of Waterloo, Ontario, 1989.
121. S.W. Hadley, F. Rendl, H. Wolkowicz, Bounds for the quadratic assignment problem using continuous optimization techniques, in Proceedings of the 1-st Integer Programming and Combinatorial Optimization Conference (IPCO), University of Waterloo Press, Waterloo, 1990, pp. 237-248.
122. S.W. Hadley, F. Rendl, H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem. Math. Oper. Res. 17, 727-739 (1992)
123. S.W. Hadley, F. Rendl, H. Wolkowicz, Nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality. Linear Algebra Appl. 58, 109-124 (1992)
124. P.M. Hahn, T. Grant, Lower bounds for the quadratic assignment problem based upon a dual formulation. Oper. Res. 46, 912-922 (1998)
125. P.M. Hahn, T. Grant, N. Hall, Solution of the quadratic assignment problem using the Hungarian method. Eur. J. Oper. Res. 108, 629-640 (1998)
126. P.M. Hahn, Y.-R. Zhu, M. Guignard, W.L. Hightower, M.J. Saltzman, A level-3 reformulation- linearization technique-based bound for the quadratic assignment problem. INFORMS J. Comput. 24, 202-209 (2012)
127. G.G. Hardy, J.E. Littlewood, G. Pttlya, Inequalities (Cambridge University Press, New York, 1952)
128. M. Hanan, J.M. Kurtzberg, A review of the placement and quadratic assignment problems. SIAM Rev. 14, 324-342 (1972)
129. D.R. Heffley, Assigning runners to a relay team, in Optimal Strategies in Sports, ed. by S.P. Ladany, R.E. Machol (North-Holland, Amsterdam, 1977), pp. 169-171.
130. J.H. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975)
131. L.J. Hubert, Assignment Methods in Combinatorial Data Analysis (Marcel Dekker, New York, 1987)
132. T. James, C. Rego, F. Glover, Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 39, 579-596 (2009)
133. D.S. Johnson, C.H. Papadimitriou, M. Yannakakis, How easy is local search, J. Comput. Syst. Sci. 37, 79-100 (1988)
134. T.A. Johnson, New linear programming-based solution procedures for the quadratic assignment problem. Ph.D. Thesis, Clemson University, SC, 1992.
135. M. Jünger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem (Heldermann Verlag, Berlin, 1985)
136. M. Jünger, V. Kaibel, A basic study of the QAP polytope. Technical Report 96.215, Institut für Informatik, Universitat zü Koln, Germany, 1996.
137. M. Jünger, V. Kaibel, On the SQAP polytope. SIAM J. Optim. 11, 444-463 (2000)
138. V. Kaibel, Polyhedral combinatorics of the qüadratic assignment problem. Ph.D. Thesis, Universität zü Köln, Germany, 1997.
139. S.E. Karisch, Nonlinear approaches for qüadratic assignment and graph partition problems. Ph.D. Thesis, Graz University of Technology, Aüstria, 1995.
140. S.E. Karisch, E. Jela, J. Claüsen, T. Espersen, A düal framework for lower boünds of the quadratic assignment problem based on linearization. Compüting 63, 351-403 (1999)
141. S.E. Karisch, F. Rendl, Lower boünds for the qüadratic assignment problem via triangle decompositions. Math. Program. 71, 137-151 (1995)
142. R.M. Karp, Redücibility among combinatorial problems, in Complexity of Computer Computations, ed. by R.E. MiUer, J.W. Thatcher (Plenüm, New York, 1972), pp. 85-103.
143. L. Kaufman, F. Broeckx, An algorithm for the qüadratic assignment problem üsing Benders' decomposition. Eür. J. Oper. Res. 2, 204-211 (1978)
144. B. Kernighan, S. Lin, An efScient heüristic procedüre for partitioning graphs. Bell Syst. J. 49, 291-307 (1972)
145. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by simülated annealing. Science 220, 671-680 (1983)
146. T.C. Koopmans, M.J. Beckmann, Assignment problems and the location of economic activities. Econometrica 25, 53-76 (1957)
147. J. Krarup, P.M. Prüzan, Compüter-aided layoüt design. Math. Program. Stüdy 9, 75-94 (1978)
148. A.V. Krushevski, The linear programming problem on a permütation groüp, in Proceedings of the Seminar on Methods of Mathematical Modeling and Theory of Electrical Circuits, vol. 3, Institüte of Cybernetics of the Academy of Sciences of Ukraine, Kiev, 1964, pp. 364-371 (Rüssian)
149. P.J.M. van Laarhoven, E.H.L. Aarts, Simulated Annealing: Theory and Applications (D. Reidel Püblishing Company, Dordrecht, 1988)
150. A.M. Land, A problem of assignment with interrelated costs. Oper. Res. Q. 14, 185-198 (1963)
151. G. Laporte, H. Mercüre, Balancing hydraülic türbine rünners: a qüadratic assignment problem. Eur. J. Oper. Res. 35, 378-382 (1988)
152. E.L. Lawler, The qüadratic assignment problem. Manag. Sci. 9, 586-599 (1963)
153. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (eds.), The Traveling Salesman Problem (Wiley, Chichester, 1985)
154. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout (Wiley, Chichester, 1990)
155. W. Leontief, Input-Output Economics (Oxford University Press, New York, 1966)
156. Y. Li, P.M. Pardalos, Generating qüadratic assignment test problems with known optimal permütations. Compüt. Optim. Appl. 1, 163-184 (1992)
157. Y. Li, P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, Lower boünds for the qüadratic assignment problem. Ann. Oper. Res. 50, 387-410 (1994)
158. Y. Li, P.M. Pardalos, M.G.C. Resende, A greedy randomized adaptive search procedüre for the quadratic assignment problem, in Quadratic Assignment and Related Problems, ed. by P. Pardalos, H. Wolkowicz. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, 1994), pp. 237-261.
159. M.H. Lim, Y. Yüan, S. Omatü, Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems. Compüt. Optim. Appl. 23, 47-64 (2002)
160. E.M. Loiola, N.M. Maia de Abreü, P.O. Boaventüra-Netto, P.M. Hahn, T. Qüerido, A sürvey for the quadratic assignment problem. Eür. J. Oper. Res. 176, 657-690 (2007)
161. L. Lovasz, A. Schrijver, Cones of matrices and set fünctions and 0-1 optimization. SIAM J. Optim. 1, 166-190 (1991)
162. E.J. McCormick, Human Factors Engineering (McGraw-Hill, New York, 1970)
163. F. Malucelli, Quadratic assignment problems: solution methods and applications. Ph.D. Thesis, Dipartimento di Informatica, Universita di Pisa, Italy, 1993.
164. F. Malucelli, A polynomially solvable class of quadratic semi-assignment problems. Eur. J. Oper. Res. 91, 619-622 (1996)
165. F. Malucelli, D. Pretolani, Lower bounds for the quadratic semi-assignment problem. Eur. J. Oper. Res. 83, 365-375 (1995)
166. T. Mautor, C. Roucairol, A new exact algorithm for the solution of quadratic assignment problems. Discrete Appl. Math. 55, 281-293 (1994)
167. T. Mavridou, P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, A GRASP for the biquadratic assignment problem. Eur. J. Oper. Res. 105, 613-621 (1998)
168. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1092 (1953)
169. I.Z. Milis, V.F. Magirou, A Lagrangean relaxation algorithm for sparse quadratic assignment problems. Oper. Res. Lett. 17, 69-76 (1995)
170. G. Miranda, H.P.L. Luna, G.R. Mateus, R.P.M. Ferreira, A performance guarantee heuristic for electronic components placement problems including thermal effects. Comput. Oper. Res. 32, 2937-2957 (2005)
171. P.B. Mirchandani, T. Obata, Locational decisions with interactions between facilities: the quadratic assignment problem a review. Working Paper Ps-79-1, Rensselaer Polytechnic Institute, Troy, New York, May 1979.
172. L. Mirsky, The spread of a matrix. Mathematika 3, 127-130 (1956)
173. A. Misevicius, An improved hybrid optimization algorithm for the quadratic assignment problem. Math. Model. Anal. 9, 149-168 (2004)
174. H.D. Mittelmann, J. Peng, Estimating bounds for quadratic assignment problems with Hamming and Manhattan distance matrices based on semidefinte programming. SIAM J. Optim. 20, 3408-3426 (2010)
175. N. Mladenovic, P. Hansen, Variable neighborhood search. Comput. Oper. Res. 24, 1097-1100 (1997)
176. J. Mosevich, Balancing hydraulic turbine runners-a discrete combinatorial optimization problem. Eur. J. Oper. Res. 26, 202-204 (1986)
177. K.A. Murthy, P. Pardalos, Y. Li, A local search algorithm for the quadratic assignment problem. Informatica 3, 524-538 (1992)
178. H. Muller-Merbach, Optimale Reihenfolgen (Springer, Berlin, 1970), pp. 158-171.
179. C.E. Nugent, T.E. Vollmann, J. Ruml, An experimental comparison of techniques for the assignment of facilities to locations. J. Oper. Res. 16, 150-173 (1969)
180. M.W. Padberg, M.P. Rijal, Location, Scheduling, Design and Integer Programming (Kluwer Academic, Boston, 1996)
181. G.S. Palubeckis, A generator of test quadratic assignment problems with known optimal solution. USSR Comput. Math. Math. Phys. 28, 97-98 (1988)
182. G.S. Palubeckis, The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. Informatica 8, 377-400 (1997)
183. G.S. Palubeckis, Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem. J. Global Optim. 15, 127-156 (1999)
184. G.S. Palubeckis, An algorithm for construction of test cases for the quadratic assignment problem. Informatica 11, 281-296 (2000)
185. C.H. Papadimitriou, D. Wolfe, The complexity of facets resolved, in Proceedings of the 25-th Annual IEEE Symposium on the Foundations of Computer Science (FOCS), Portland, USA, 1985, pp. 74-78.
186. P. Pardalos, J. Crouse, A parallel algorithm for the quadratic assignment problem, in Proceedings of the Supercomputing Conference 1989, ACM, 1989, pp. 351-360.
187. P. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: a survey and recent developments, in Quadratic Assignment and Related Problems, ed. by P. Pardalos, H. Wolkowicz. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16 (AMS, Providence, 1994), pp. 1-42.
188. P.M. Pardalos, L.S. Pitsoulis, M.G.C. Resende, A parallel GRASP implementation for solving the quadratic assignment problem, in Parallel Algorithms for Irregular Problem: State of the Art, ed. by A. Ferreira, J.D.P. Rolim (Kluwer Academic, Norwell, 1995), pp. 115-133.
189. P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, Y. Li, Implementation of a variable reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem. SIAM J. Optim. 7, 280-294 (1997)
190. P.M. Pardalos, J. Xue, The maximum clique problem. J. Global Optim. 4, 301-328 (1994)
191. J. Peng, H.D. Mittelmann, X. Li, A new relaxation framework for quadratic assignment problems based on matrix splitting. Math. Program. Comput. 2, 59-77 (2010)
192. L. Pitsoulis, P.M. Pardalos, Quadratic assignment problem, in Encyclopedia of Optimization, 2nd edn., ed. by Ch.A. Floudas, P.M. Pardalos (Springer, Berlin, 2009), pp. 3119-3149.
193. J. Povh, F. Rendl, Copositive and semidefinite relaxations of the quadratic assignment problem. J. Discrete Optim. 6, 231-241 (2009)
194. M. Queyranne, Performance ratio of heuristics for triangle inequality quadratic assignment problems. Oper. Res. Lett. 4, 231-234 (1986)
195. A.S. Ramkumar, S.G. Ponnambalam, N. Jawahar, A population-based hybrid ant system for quadratic assignment formulations in facility layout design. Int. J. Adv. Manuf. Technol. 44, 548-558 (2008)
196. G. Reinelt, The Linear Ordering Problem: Algorithms and Applications (Heldermann Verlag, Berlin, 1985)
197. F. Rendl, Ranking scalar products to improve bounds for the quadratic assignment problem. Eur. J. Oper. Res. 20, 363-372 (1985)
198. F. Rendl, Quadratic assignment problems on series-parallel digraphs. Z. Oper. Res. 30, 161-173 (1986)
199. F. Rendl, R. Sotirov, Bounds for the quadratic assignment problem using the bundle method. Math. Program. B 109, 505-524 (2007)
200. F. Rendl, H. Wolkowicz, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math. Program. 53, 63-78 (1992)
201. M.G.C. Resende, K.G. Ramakrishnan, Z. Drezner, Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Oper. Res. 43, 781-791 (1995)
202. W.T. Rhee, A note on asymptotic properties of the quadratic assignment problem. Oper. Res. Lett. 7, 197-200 (1988)
203. W.T. Rhee, Stochastic analysis of the quadratic assignment problem. Math. Oper. Res. 16, 223-239 (1991)
204. J.M. Rodriguez, F.C. MacPhee, D.J. Bonham, V.C. Bhavsar, Solving the quadratic assignment and dynamic plant layout problems using a new hybrid meta-heuristic approach. Int. J. High Perform. Comput. Netw. 4, 286-294 (2006)
205. C. Roucairol, A reduction method for quadratic assignment problems. Oper. Res. Verfahren 32, 183-187 (1979)
206. C. Roucairol, A parallel branch and bound algorithm for the quadratic assignment problem. Discrete Appl. Math. 18, 221-225 (1987)
207. F. Roupin, Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework. Int. J. Math. Oper. Res. 1, 144-162 (2009)
208. S. Sahni, T. Gonzalez, P-complete approximation problems. J. Assoc. Comput. Mach. 23, 555-565 (1976)
209. A. Schaffer, M. Yannakakis, Simple local search problems that are hard to solve. SIAM J. Comput. 20, 56-87 (1991)
210. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem. ORSA J. Comput. 2, 33-45 (1990)
211. J. Skorin-Kapov, Extensions of tabu search adaptation to the quadratic assignment problem. Comput. Oper. Res. 21, 855-865 (1994)
212. H.S. Stone, Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Softw. Eng. 3, 85-93 (1977)
213. Y.G. Stoyan, V.Z. Sokolovskii, S.V. Yakovlev, A method for balancing discretely distributed masses under rotation. Energomashinostroenia 2, 4-5 (1982) (in Russian)
214. Th. Stutzle, S. Fernandes, New benchmark instances for the QAP and the experimental analysis of algorithms, in EvoCOP 2004, ed. by J. Gottlieb, G.R. Raidl. Lecture Notes in Computer Science, vol. 3004 (Springer, Berlin, 2004), pp. 199-209.
215. W. Szpankowski, Combinatorial optimization problems for which almost every algorithm is asymptotically optimal! Optimization 33, 359-367 (1995)
216. E. Taülard, Robust tabu search for the quadratic assignment problem. Parallel Comput. 17, 443-455 (1991)
217. D.M. Tate and A.E. Smith, A genetic approach to the quadratic assignment problem. Comput. Oper. Res. 22, 73-83 (1995)
218. L.-Y. Tseng, S.-C. Liang, A hybrid metaheuristic for the quadratic assignment problem. Comput. Optim. Appl. 34, 85-113 (2006)
219. S. Tsutsui, Parallel ant colony optimization for the quadratic assignment problems with symmetric multi processing, in ANTS 2008, ed. by M. Dorigo et al. Lecture Notes in Computer Science, vol. 5217 (Springer, Berlin, 2008), pp. 363-370.
220. I. Ugi, J. Bauer, J. Friedrich, J. Gasteiger, C. Jochum, W. Schubert, Neue Anwendungsgebiete fur Computer in der Chemie. Angewandte Chemie 91 (1979), 99-111.
221. S. Voß, Heuristics for nonlinear assignment problems, in Nonlinear Assignment Problems, ed. by M. Desrochers, J.M. Rousseau. Lecture Notes in Economics and Mathematical Systems, vol. 386 (Springer, Berlin, 2000), pp. 137-152.
222. H. Wiener, Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69, 17-20 (1947)
223. M.R. Wilhelm, T.L. Ward, Solving quadratic assignment problems by simulated annealing. IEEE Trans. 19, 107-119 (1987)
224. T. Winter, U. Zimmermann, Dispatch of trams in storage yards. Ann. Oper. Res. 96, 287-315 (2000)
225. X. Wu, H.D. Mittelmann, X. Wang, J. Wang, On computation of performance bounds of optimal index assignment, in Data Compression Conference (DCC) 2010, IEEE, pp. 189198. doi:10.1109/DCC.2010.24.
226. Q. Zhao, Semidefinite programming for assignment and partitioning problems. Ph.D. Thesis, University of Waterloo, Ontario, 1996.
227. S.B. Zahir Azami, P. Duhamel, O. Rioul, Joint source-channel coding: panorama of methods, in Proceedings of the CNES Workshop on Data Compression, Toulouse (France), November 1996, pp. 1232-1254, http://www.comelec.enst.fr/~rioul/research/dvips/csccp.ps
228. H. Zhang, C. Beltran-Royo, L. Ma, Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. Ann. Oper. Res. publ. (2012), DOI 10.1007/s10479-012-1079-4, http://www.optimization-online.org
229. Q. Zhao, S.E. Karisch, F. Rendl, H. Wolkowicz, Semidefinite relaxations for the quadratic assignment problem. J. Combin. Optim. 2, 71-109 (1998)