{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:31:05Z","timestamp":1742988665636,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":140,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_534","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:09:00Z","timestamp":1219662540000},"page":"3119-3149","source":"Crossref","is-referenced-by-count":8,"title":["Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Leonidas","family":"Pitsoulis","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Local search in combinatorial optimization","year":"1997","key":"534_CR1_534","unstructured":"Aarts E, Lenstra JK (eds) (1997) Local search in combinatorial optimization. Wiley, New York"},{"key":"534_CR2_534","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/dimacs\/016\/02","volume-title":"Quadratic Assignment and Related Problems","author":"W.P. Adams","year":"1994","unstructured":"Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos PM,\n\t  Wolkowicz H (eds) Quadratic Assignment and Related Problems. DIMACS. Amer. Math. Soc., Providence, pp\u00a043\u201375"},{"issue":"10","key":"534_CR3_534","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams WP, Sherali HD (1986) A\u00a0tight linearization and an algorithm for zero-one quadratic programming problems. Managem Sci\n\t  32(10):1274\u20131290","journal-title":"Managem. Sci."},{"issue":"2","key":"534_CR4_534","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"W.P. Adams","year":"1990","unstructured":"Adams WP, Sherali HD (1990) Linearization strategies for a\u00a0class of zero-one mixed integer programming problems. Oper Res\n\t  38(2):217\u2013226","journal-title":"Oper. Res."},{"key":"534_CR5_534","unstructured":"Ahuja RK, Orlin JB, Tivari A (1995)\n\tA\u00a0greedy genetic algorithm for the quadratic assignment problem. Techn Report 3826-95, Sloan School Management"},{"key":"534_CR6_534","first-page":"21","volume-title":"Proc. 37-th Annual IEEE Symp. Foundations of Computer Sci. (FOCS)","author":"S Arora","year":"1996","unstructured":"Arora S, Frieze A, Kaplan H (1996) A\u00a0new rounding procedure for the assignment problem with applications to dense graph\n\t  arrangement problems. In: Proc. 37-th Annual IEEE Symp. Foundations of Computer Sci. (FOCS). IEEE, New York, pp\u00a021\u201330"},{"key":"534_CR7_534","unstructured":"Balas E, Mazzola JB (1980) Quadratic 0-1\n\tprogramming by a\u00a0new linearization. In: Proc TIMS\/ORSA, May 1980"},{"key":"534_CR8_534","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"Balas E, Mazzola JB (1984) Nonlinear programming: I. Linearization techniques. Math Program 30:1\u201321","journal-title":"Math. Program."},{"key":"534_CR9_534","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/BF02591797","volume":"30","author":"E. Balas","year":"1984","unstructured":"Balas E, Mazzola JB (1984) Nonlinear programming: II. Dominance relations and algorithms. Math Program\n\t  30:22\u201345","journal-title":"Math. Program."},{"key":"#cr-split#-534_CR10_534.1","unstructured":"Balas E, Qi L (1993) Linear-time"},{"key":"#cr-split#-534_CR10_534.2","unstructured":"separation algorithms for the three-index assignment polytope. Discrete Appl Math (1993):1-12"},{"key":"#cr-split#-534_CR11_534.1","unstructured":"Balas E, Saltzman MJ (1989) Facets of"},{"key":"#cr-split#-534_CR11_534.2","doi-asserted-by":"crossref","unstructured":"the three-index assignment polytope. Discrete Appl Math (1989):201-229","DOI":"10.1016\/0166-218X(89)90014-0"},{"key":"#cr-split#-534_CR12_534.1","unstructured":"Battiti R, Tecchiolli G (1994) The"},{"key":"#cr-split#-534_CR12_534.2","doi-asserted-by":"crossref","unstructured":"reactive tabu search. ORSA J Comput (1994):126-140","DOI":"10.1287\/ijoc.6.2.126"},{"key":"534_CR13_534","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/nav.3800270104","volume":"27","author":"M.S. Bazaraa","year":"1980","unstructured":"Bazaraa MS, Sherali HD (1980) Bender's partitioning scheme applied to a\u00a0new formulation of the quadratic assignment\n\t  problem. Naval Res Logist Quart 27:29\u201341","journal-title":"Naval Res. Logist. Quart."},{"key":"534_CR14_534","doi-asserted-by":"publisher","first-page":"991","DOI":"10.2307\/2581513","volume":"33","author":"M.S. Bazaraa","year":"1982","unstructured":"Bazaraa MS, Sherali HD (1982) On the use of exact and heuristic cutting plane methods for the quadratic assignment\n\t  problem. J\u00a0Oper Res Soc 33:991\u20131003","journal-title":"J. Oper. Res. Soc."},{"key":"534_CR15_534","unstructured":"Birkoff G (1946) Tres observaciones\n\tsobre el algebra lineal. Univ Nac Tucuman Rev (A):147\u2013151"},{"key":"534_CR16_534","volume-title":"Extremal graph theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s B (1978) Extremal graph theory. Acad. Press, New York"},{"key":"534_CR17_534","first-page":"136","volume":"42","author":"E.S. Buffa","year":"1962","unstructured":"Buffa ES, Armour GC, Vollmann TE (1962) Allocating facilities with CRAFT. Harvard Business Rev 42:136\u2013158","journal-title":"Harvard Business Rev."},{"key":"534_CR18_534","first-page":"84","volume":"16","author":"R.E. Burkard","year":"1973","unstructured":"Burkard RE (1973) Die St\u00f6rungsmethode zur L\u00f6sung quadratischer Zuordnungsprobleme. Oper Res Verfahren\n\t  16:84\u2013108","journal-title":"Oper. Res. Verfahren"},{"key":"534_CR19_534","first-page":"26","volume":"18","author":"R.E. Burkard","year":"1974","unstructured":"Burkard RE (1974) Quadratische Bottleneckprobleme. Oper Res Verfahren 18:26\u201341","journal-title":"Oper. Res. Verfahren"},{"key":"534_CR20_534","volume-title":"Discrete Location Theory","author":"R.E. Burkard","year":"1991","unstructured":"Burkard RE (1991) Locations with spatial interactions: the quadratic assignment problem. In: Mirchandani PB, Francis RL (eds)\n\t  Discrete Location Theory. Wiley, New York"},{"key":"534_CR21_534","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0377-2217(83)90097-8","volume":"13","author":"R.E. Burkard","year":"1983","unstructured":"Burkard RE, B\u00f6nniger T (1983) A\u00a0heuristic for quadratic Boolean programs with applications to quadratic assignment\n\t  problems. Europ J Oper Res 13:374\u2013386","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR22_534","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0377-2217(95)00007-D","volume":"83","author":"R.E. Burkard","year":"1995","unstructured":"Burkard RE, \u00c7ela E (1995) Heuristics for biquadratic assignment problems and their computational comparison. Europ J Oper Res\n\t  83:283\u2013300","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR23_534","unstructured":"Burkard RE, \u00c7ela E, Demidenko\n\tVM, Metelski NN, Woeginger GJ (1997) Perspectives of easy and hard cases of the quadratic assignment problems. Techn Report SFB 104, Techn Univ\n\tGraz"},{"key":"534_CR24_534","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1090\/dimacs\/016\/05","volume-title":"Quadratic assignment and related problems","author":"R.E. Burkard","year":"1994","unstructured":"Burkard RE, \u00c7ela E, Klinz B (1994) On the biquadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic\n\t  assignment and related problems. DIMACS. Amer. Math. Soc., Providence, pp\u00a0117\u2013146"},{"key":"534_CR25_534","volume-title":"Handbook Combinatorial Optim.","author":"R.E. Burkard","year":"1998","unstructured":"Burkard RE, \u00c7ela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. In: Du D-Z and Pardalos PM (eds) Handbook\n\t  Combinatorial Optim., vol\u00a03. Kluwer, Dordrecht, pp\u00a0241\u2013337"},{"key":"534_CR26_534","doi-asserted-by":"crossref","unstructured":"Burkard RE, \u00c7ela E, Rote G,\n\tWoeginger GJ (1995) The quadratic assignment problem with an Anti-Monge and a\u00a0Toeplitz matrix: Easy and hard cases. Techn Report SFB 34, Techn Univ\n\tGraz","DOI":"10.1007\/3-540-61310-2_16"},{"key":"534_CR27_534","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01583791","volume":"23","author":"R.E. Burkard","year":"1982","unstructured":"Burkard RE, Fincke U (1982) On random quadratic bottleneck assignment problems. Math Program 23:227\u2013232","journal-title":"Math. Program."},{"key":"534_CR28_534","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01916903","volume":"27","author":"R.E. Burkard","year":"1983","unstructured":"Burkard RE, Fincke U (1983) The asymptotic probabilistic behaviour of quadratic sum assignment problems. Z Oper Res\n\t  27:73\u201381","journal-title":"Z. Oper. Res."},{"key":"534_CR29_534","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(85)90037-X","volume":"12","author":"R.E. Burkard","year":"1985","unstructured":"Burkard RE, Fincke U (1985) Probabilistic asymptotic properties of some combinatorial optimization problems. Discrete Appl Math\n\t  12:21\u201329","journal-title":"Discrete Appl. Math."},{"key":"534_CR30_534","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BF01593800","volume":"12","author":"R.E. Burkard","year":"1977","unstructured":"Burkard RE, Hahn W, Zimmermann U (1977) An algebraic approach to assignment problems. Math Program 12:318\u2013327","journal-title":"Math. Program."},{"key":"534_CR31_534","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard RE, Karisch S, Rendl F (1997) QAPLIB\u00a0\u2013 Aquadratic assignment problem library. J\u00a0Global Optim\n\t  10:391\u2013403","journal-title":"J. Global Optim."},{"key":"534_CR32_534","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R.E. Burkard","year":"1996","unstructured":"Burkard RE, Klinz B, Rudolf R (1996) Perspectives of Monge properties in optimization. Discrete Appl Math\n\t  70:95\u2013161","journal-title":"Discrete Appl. Math."},{"key":"534_CR33_534","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R.E. Burkard","year":"1984","unstructured":"Burkard RE, Rendl F (1984) A\u00a0thermodynamically motivated simulation procedure for combinatorial optimization problems. Europ J\n\t  Oper Res 17:169\u2013174","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR34_534","first-page":"392","volume-title":"Modern Applied Mathematics","author":"R.E. Burkard","year":"1982","unstructured":"Burkard RE, Zimmermann U (1982) Combinatorial optimization in linearly ordered semimodules: A\u00a0survey. Modern Applied\n\t  Mathematics. North-Holland, Amsterdam, pp\u00a0392\u2013436"},{"key":"534_CR35_534","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The quadratic assignment problem: Theory and algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela E (1998) The quadratic assignment problem: Theory and algorithms. Kluwer, Dordrecht"},{"key":"534_CR36_534","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02022999","volume":"41","author":"J. Chakrapani","year":"1993","unstructured":"Chakrapani J, Skorin-Kapov J (1993) Massively parallel tabu search for the quadratic assignment problem. Ann Oper Res\n\t  41:327\u2013342","journal-title":"Ann. Oper. Res."},{"key":"534_CR37_534","unstructured":"Christofides N (1976) Worst case\n\tanalysis of a\u00a0new heuristic for the traveling salesman problem. Grad School Industr Admin Carnegie-Mellon Univ 338"},{"key":"534_CR38_534","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"A. Colorni","year":"1996","unstructured":"Colorni A, Dorigo M, Maniezzo V (1996) The ant system: optimization by a\u00a0colony of cooperating agents. IEEE Trans Syst, Man\n\t  Cybern Part B 26:29\u201341","journal-title":"IEEE Trans. Syst., Man Cybern. Part B"},{"key":"534_CR39_534","doi-asserted-by":"crossref","unstructured":"Colorni A, Maniezzo V (1998) The ant\n\tsystem applied to the quadratic assignment problem. IEEE Trans Knowledge and Data Enginto","DOI":"10.1109\/69.806935"},{"key":"534_CR40_534","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"Connolly DT (1990) An improved annealing scheme for the QAP. Europ J Oper Res 46:93\u2013100","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR41_534","volume-title":"Das quadratische Zuweisungsproblem und zwei seiner Spezialfalle","author":"K. Conrad","year":"1971","unstructured":"Conrad K (1971) Das quadratische Zuweisungsproblem und zwei seiner Spezialfalle. Mohr-Siebeck, T\u00fcbingen"},{"key":"534_CR42_534","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/81.298362","volume":"41","author":"D. Cyganski","year":"1994","unstructured":"Cyganski D, Vaz RF, Virball VG (1994) Quadratic assignment problems with the Palubeckis' algorithm are degenerate. IEEE Trans\n\t  Circuits and Systems I 41:481\u2013484","journal-title":"IEEE Trans. Circuits and Systems I"},{"key":"534_CR43_534","volume-title":"Genetic algorithms and simulated annealing","author":"L. Davis","year":"1987","unstructured":"Davis L (1987) Genetic algorithms and simulated annealing. Pitman, Boston"},{"key":"534_CR44_534","unstructured":"Deneko VG, Woeginger GJ (1996)\n\tA\u00a0solvable case of the quadratic assignment problem. Techn Report SFB 88,Inst Math, Techn Univ Graz"},{"key":"534_CR45_534","unstructured":"Dorigo M (1992) Optimization,\n\tlearning, and natural algorithms. PhD Thesis, Dip. Elettronica e Informazione Politecn. Milano. (In Italian)"},{"key":"534_CR46_534","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01589437","volume":"35","author":"M.E. Dyer","year":"1986","unstructured":"Dyer ME, Frieze AM, McDiarmid CJH (1986) On linear programs with random costs. Math Program 35:3\u201316","journal-title":"Math. Program."},{"key":"534_CR47_534","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120905","volume":"13","author":"C.S. Edwards","year":"1980","unstructured":"Edwards CS (1980) A\u00a0branch and bound algorithm for the Koopmans\u2013Beckman quadratic assignment problem. Math Program Stud\n\t  13:35\u201352","journal-title":"Math. Program. Stud."},{"key":"534_CR48_534","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J\u00a0Global Optim 6:109\u2013133","journal-title":"J. Global Optim."},{"key":"534_CR49_534","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo TA, Resende MGC, Smith SH (1994) A\u00a0greedy randomized adaptive search procedure for maximum independent set. Oper Res\n\t  42:860\u2013878","journal-title":"Oper. Res."},{"key":"534_CR50_534","unstructured":"Finke G, Burkard RE, Rendl F (1984)\n\tEigenvalue approach to quadratic assignment problems. In: 5th Symp. Oper. Res., 1984"},{"key":"534_CR51_534","first-page":"61","volume":"31","author":"G. Finke","year":"1987","unstructured":"Finke G, Burkard RE, Rendl F (1987) Quadratic assignment problems. Ann Discret Math 31:61\u201382","journal-title":"Ann. Discret Math."},{"key":"534_CR52_534","series-title":"DIMACS","first-page":"43","volume-title":"Quadratic assignment and related problems","author":"C. Fleurent","year":"1994","unstructured":"Fleurent C, Ferland J (1994) Genetic hybrids for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic\n\t  assignment and related problems. DIMACS. Amer. Math. Soc., Providence pp\u00a043\u201375"},{"key":"534_CR53_534","series-title":"Lecture Notes Computer Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"A collection of test problems for constrained global optimization algorithms","author":"C.A. Floudas","year":"1990","unstructured":"Floudas CA, Pardalos PM (1990) A\u00a0collection of test problems for constrained global optimization algorithms. Lecture Notes\n\t  Computer Sci, vol\u00a0455. Springer, Berlin"},{"key":"534_CR54_534","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.10.1.100","volume":"10","author":"J.C.B. Frenk","year":"1985","unstructured":"Frenk JCB, van Houweninge M and, Rinnooy Kan AHG (1985) Asymptotic properties of assignment problems. Math Oper Res\n\t  10:100\u2013116","journal-title":"Math. Oper. Res."},{"key":"534_CR55_534","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01585532","volume":"7","author":"A.M. Frieze","year":"1974","unstructured":"Frieze AM (1974) A\u00a0bilinear programming formulation of the 3-dimensional assignment problem. Math Program\n\t  7:376\u2013379","journal-title":"Math. Program."},{"key":"534_CR56_534","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","volume":"5","author":"A.M. Frieze","year":"1983","unstructured":"Frieze AM, Yadegar J (1983) On the quadratic assignment problem. Discrete Appl Math 5:89\u201398","journal-title":"Discrete Appl. Math."},{"key":"534_CR57_534","unstructured":"Gambardella LM, Taillard ED, Dorigo M\n\t(1997) Ant colonies for the QAP. Techn Report IDSIA-4-97, Ist dalle Molle Di Studi sull'Intelligenza Artificiale Lugano"},{"key":"534_CR58_534","volume-title":"Computers and intractability: A\u00a0guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: A\u00a0guide to the theory of NP-completeness. Freeman, New\n\t  York"},{"key":"534_CR59_534","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/opre.14.2.210","volume":"14","author":"J.W. Gavett","year":"1966","unstructured":"Gavett JW, Plyter NV (1966) The optimal assignment of facilities to locations by branch and bound. Oper Res\n\t  14:210\u2013232","journal-title":"Oper. Res."},{"key":"534_CR60_534","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"P.C. Gilmore","year":"1962","unstructured":"Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math\n\t  10:305\u2013313","journal-title":"SIAM J. Appl. Math."},{"key":"534_CR61_534","unstructured":"(1993) Tabu search. Ann Oper Res\n\t41"},{"key":"534_CR62_534","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u00a0\u2013 Part I. ORSA J Comput 1:190\u2013206","journal-title":"ORSA J. Comput."},{"key":"534_CR63_534","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u00a0\u2013 Part II. ORSA J Comput 2:4\u201332","journal-title":"ORSA J. Comput."},{"key":"534_CR64_534","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"534_CR65_534","unstructured":"Hadley SW (1989) Continuous\n\toptimization approaches for the quadratic assignment problem. PhD Thesis, Univ. Waterloo"},{"key":"534_CR66_534","first-page":"237","volume-title":"Integer Programming and Combinatorial Optimization","author":"S.W. Hadley","year":"1990","unstructured":"Hadley SW, Rendl F, Wolkowicz H (1990) Bounds for the quadratic assignment problem using continuous optimization techniques. Integer\n\t  Programming and Combinatorial Optimization. Univ. Waterloo Press, Waterloo, pp\u00a0237\u2013248"},{"issue":"3","key":"534_CR67_534","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S.W. Hadley","year":"1992","unstructured":"Hadley SW, Rendl F, Wolkowicz H (1992) A\u00a0new lower bound via projection for the quadratic assignment problem. Math Oper Res\n\t  17(3):727\u2013739","journal-title":"Math. Oper. Res."},{"key":"534_CR68_534","first-page":"109","volume":"58","author":"S.W. Hadley","year":"1992","unstructured":"Hadley SW, Rendl F, Wolkowicz H (1992) Nonsymmetric quadratic assignment problems and the Hoffman\u2013Wielandt Inequality. Linear\n\t  Alg & its Appl 58:109\u2013124","journal-title":"Linear Alg. & its Appl."},{"key":"534_CR69_534","volume-title":"Inequalities","author":"G.G. Hardy","year":"1952","unstructured":"Hardy GG, Littlewood JE, Polya G (1952) Inequalities. Cambridge Univ. Press, Cambridge"},{"key":"534_CR70_534","unstructured":"Heider CH (1972)\n\tA\u00a0computationally simplified pair exchange algorithm for the quadratic assignment problem. Paper 101, Center Naval Anal,\n\tArlington"},{"key":"534_CR71_534","unstructured":"Jansen B (1993) A\u00a0note on lower\n\tbounds for the QAP. Techn Report (dec), Delft Univ Techn Math and Computer Sci"},{"key":"534_CR72_534","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson DS, Papadimitriou CH, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79\u2013100","journal-title":"J. Comput. Syst. Sci."},{"key":"534_CR73_534","unstructured":"Johnson TA (1992) New linear\n\tprogramming-based solution procedures for the quadratic assignment problem. PhD Thesis, Clemson Univ."},{"key":"534_CR74_534","volume-title":"Polyhedral combinatorics and the acyclic subdigraph problem","author":"M. J\u00fcnger","year":"1985","unstructured":"J\u00fcnger M (1985) Polyhedral combinatorics and the acyclic subdigraph problem. Heldermann, Berlin"},{"key":"534_CR75_534","doi-asserted-by":"crossref","unstructured":"Kaibel V (1997) Polyhedral\n\tcombinatorics of the quadratic assignment problem. PhD Thesis, Univ. K\u00f6ln","DOI":"10.1007\/3-540-69346-7_31"},{"key":"534_CR76_534","unstructured":"Karisch SE (1995) Nonlinear\n\tapproaches for quadratic assignment and graph partition problems. PhD Thesis, Techn. Univ. Graz"},{"issue":"1","key":"534_CR77_534","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"S.E. Karisch","year":"1998","unstructured":"Karisch SE, Rendl F, Wolkowicz H, Zhao Q (1998) Semidefinite programming relaxations for the quadratic assignment\n\t  problem. J\u00a0Combin Optim 2(1):71\u2013109","journal-title":"J. Combin. Optim."},{"key":"534_CR78_534","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/dimacs\/016\/10","volume-title":"Quadratic assignment and related problems","author":"S.E. Karisch","year":"1994","unstructured":"Karisch SE, Rendl F, Wolkowicz H (1994) Trust regions and the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds)\n\t  Quadratic assignment and related problems. DIMACS. Amer. Math. Soc., Providence, pp\u00a0199\u2013220"},{"key":"534_CR79_534","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Proc. Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Proc. Complexity of Computer\n\t  Computations. Plenum, New York, pp\u00a085\u2013104"},{"key":"534_CR80_534","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0377-2217(78)90095-4","volume":"2","author":"L. Kaufman","year":"1978","unstructured":"Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Benders' decomposition. Europ J Oper Res\n\t  2:204\u2013211","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR81_534","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1972","unstructured":"Kernighan B, Lin S (1972) An efficient heuristic procedure for partitioning graphs. Bell Systems J 49:291\u2013307","journal-title":"Bell Systems J."},{"key":"534_CR82_534","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"534_CR83_534","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02060483","volume":"40","author":"J.G. Klincewicz","year":"1992","unstructured":"Klincewicz JG (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann Oper Res\n\t  40:283\u2013302","journal-title":"Ann. Oper. Res."},{"key":"534_CR84_534","unstructured":"Klincewicz JG, Rajan A (1992) Using\n\tGRASPto solve the component grouping problem. Techn Report, AT&T Bell Lab"},{"key":"534_CR85_534","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T.C. Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica\n\t  25:53\u201376","journal-title":"Econometrica"},{"key":"534_CR86_534","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1057\/jors.1963.26","volume":"14","author":"A.M. Land","year":"1963","unstructured":"Land AM (1963) A\u00a0problem of assignment with interrelated costs. Oper Res Quart 14:185\u2013198","journal-title":"Oper. Res. Quart."},{"key":"534_CR87_534","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0377-2217(88)90227-5","volume":"35","author":"G. Laporte","year":"1988","unstructured":"Laporte G, Mercure H (1988) Balancing hydraulic turbine runners: A\u00a0quadratic assignment problem. Europ J Oper Res\n\t  35:378\u2013382","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR88_534","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E.L. Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Managem Sci 9:586\u2013599","journal-title":"Managem. Sci."},{"key":"534_CR89_534","volume-title":"The traveling salesman problem: A\u00a0guided tour of combinatorial optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1985) The traveling salesman problem: A\u00a0guided tour of combinatorial\n\t  optimization. Wiley, New York"},{"key":"534_CR90_534","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for intergrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer T (1990) Combinatorial algorithms for intergrated circuit layout. Wiley, New York"},{"key":"534_CR91_534","volume-title":"Input\u2013output economics","author":"W. Leontief","year":"1966","unstructured":"Leontief W (1966) Input\u2013output economics. Oxford Univ. Press, Oxford"},{"issue":"2","key":"534_CR92_534","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"Y. Li","year":"1992","unstructured":"Li Y, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl\n\t  1(2):163\u2013184","journal-title":"Comput. Optim. Appl."},{"key":"534_CR93_534","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02085649","volume":"50","author":"Y. Li","year":"1994","unstructured":"Li Y, Pardalos PM, Ramakrishnan KG, Resende MGC (1994) Lower bounds for the quadratic assignment problem. Ann Oper Res\n\t  50:387\u2013410","journal-title":"Ann. Oper. Res."},{"key":"534_CR94_534","series-title":"DIMACS 16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","volume-title":"Quadratic assignment and related problems","author":"Y. Li","year":"1994","unstructured":"Li Y, Pardalos PM, Resende MGC (1994) A\u00a0greedy randomized adaptive search procedure for the quadratic assignment problem. In:\n\t  Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS 16. Amer. Math. Soc., Providence,\n\t  pp\u00a0237\u2013261"},{"issue":"3","key":"534_CR95_534","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0377-2217(97)00083-0","volume":"105","author":"T. Mavridou","year":"1998","unstructured":"Mavridou T, Pardalos PM, Pitsoulis LS, Resende MGC (1998) A\u00a0GRASPfor the biquadratic assignment problem. Europ J Oper Res\n\t  105(3):613\u2013621","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR96_534","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equations of state calculations by fast computing\n\t  machines. J\u00a0Chem Phys 21:1087\u20131092","journal-title":"J. Chem. Phys."},{"key":"534_CR97_534","unstructured":"Mirchandani PB, Obata T (1979)\n\tLocational decisions with interactions between facilities: the quadratic assignment problem a\u00a0review. Working Paper May Ps-79-1, Rensselaer\n\tPolytechnic Inst, Troy, New York"},{"key":"534_CR98_534","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1112\/S0025579300001790","volume":"3","author":"L. Mirsky","year":"1956","unstructured":"Mirsky L (1956) The spread of a\u00a0matrix. Mathematika 3:127\u2013130","journal-title":"Mathematika"},{"key":"534_CR99_534","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0377-2217(86)90181-5","volume":"26","author":"J. Mosevich","year":"1986","unstructured":"Mosevich J (1986) Balancing hydraulic turbine runners\u00a0\u2013 a\u00a0discrete combinatorial optimization problem. Europ J Oper\n\t  Res 26:202\u2013204","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR100_534","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-87727-8","volume-title":"Optimale Reihenlorgen","author":"H. Muller-Merbach","year":"1970","unstructured":"Muller-Merbach H (1970) Optimale Reihenlorgen. Springer, Berlin"},{"key":"534_CR101_534","series-title":"DIMACS 40","first-page":"277","volume-title":"Network Design: Connectivity and Facility Location","author":"R.A. Murphey","year":"1997","unstructured":"Murphey RA, Pardalos PM, Pitsoulis L (1997) A\u00a0greedy randomized adaptive search procedure for the multitarget multisensor\n\t  tracking problem. In: Pardalos PM, Du D-Z (eds) Network Design: Connectivity and Facility Location. DIMACS 40. Amer. Math. Soc., Providence,\n\t  pp\u00a0277\u2013302"},{"key":"534_CR102_534","series-title":"IMA vol\u00a0Math. Appl.","first-page":"159","volume-title":"Parallel Processing of Discrete Problems","author":"R.A. Murphey","year":"1998","unstructured":"Murphey RA, Pardalos PM, Pitsoulis L (1998) A\u00a0parallel GRASP for the data association multidimensional assignment\n\t  problem. Parallel Processing of Discrete Problems. In: IMA vol\u00a0Math Appl, vol\u00a0106. Springer, Berlin, pp\u00a0159\u2013180"},{"issue":"4","key":"534_CR103_534","first-page":"524","volume":"3","author":"K.A. Murthy","year":"1992","unstructured":"Murthy KA, Pardalos PM, Li Y (1992) A\u00a0local search algorithm for the quadratic assignment problem. Informatica\n\t  3(4):524\u2013538","journal-title":"Informatica"},{"key":"534_CR104_534","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"Murty KG (1968) An algorithm for ranking all the assignments in order of increasing cost. Oper Res 16:682\u2013287","journal-title":"Oper. Res."},{"key":"534_CR105_534","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C.E. Nugent","year":"1969","unstructured":"Nugent CE, Vollmann TE, Ruml J (1969) An experimental comparison of techniques for the assignment of facilities to\n\t  locations. J\u00a0Oper Res 16:150\u2013173","journal-title":"J. Oper. Res."},{"key":"534_CR106_534","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1379-3","volume-title":"Location, scheduling, design and integer programming","author":"M.W. Padberg","year":"1996","unstructured":"Padberg MW, Rijal MP (1996) Location, scheduling, design and integer programming. Kluwer, Dordrecht"},{"issue":"11","key":"534_CR107_534","first-page":"1740","volume":"28","author":"G.S. Palubetskis","year":"1988","unstructured":"Palubetskis GS (1988) Generation of quadratic assignment test problems with known optimal solutions. Zh Vychisl Mat Mat Fiz\n\t  28(11):1740\u20131743. (In Russian.)","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"534_CR108_534","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH, Wolfe D (1985)\n\tThe complexity of facets resolved. In: Proc Foundations Computer Sci, pp\u00a074\u201378","DOI":"10.1109\/SFCS.1985.56"},{"key":"534_CR109_534","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-1-4757-6130-6_6","volume-title":"Parallel Algorithms for Irregular Problems: State of the Art","author":"P.M. Pardalos","year":"1995","unstructured":"Pardalos PM, Pitsoulis LS, Resende MGC (1995) A\u00a0parallel GRASP implementation for solving the quadratic assignment problem. In:\n\t  Ferreira A\u00a0and Rolim JDP (eds) Parallel Algorithms for Irregular Problems: State of the Art. Kluwer, Dordrecht,\n\t  pp\u00a0115\u2013133"},{"key":"534_CR110_534","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/264029.264038","volume":"23","author":"P.M. Pardalos","year":"1997","unstructured":"Pardalos PM, Pitsoulis LS, Resende MGC (1997) Algorithm 769: FORTRAN subroutines for approximate solution of sparse quadratic\n\t  assignment problems. ACM Trans Math Softw 23:196\u2013208","journal-title":"ACM Trans. Math. Software"},{"issue":"1","key":"534_CR111_534","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/S1052623494273393","volume":"7","author":"P.M. Pardalos","year":"1997","unstructured":"Pardalos PM, Ramakrishnan KG, Resende MGC, Li Y (1997) Implementation of a\u00a0variable reduction based lower bound in a\u00a0branch\n\t  and bound algorithm for the quadratic assignment problem. SIAM J Optim 7(1):280\u2013294","journal-title":"SIAM J. Optim."},{"key":"534_CR112_534","series-title":"DIMACS 16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/016","volume-title":"Quadratic assignment and related problems","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos PM, Rendl F, Wolkowicz H (1994) The quadratic assignment problem: A\u00a0survey and recent developments. In: Pardalos PM,\n\t  Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS vol\u00a016. Amer. Math. Soc., Providence, pp\u00a01\u201342"},{"key":"534_CR113_534","series-title":"DIMACS","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/016","volume-title":"Quadratic assignment and related problems","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos PM, Wolkowicz H (1994) Quadratic assignment and related problems. DIMACS, vol\u00a016. Amer. Math. Soc.,\n\t  Providence"},{"key":"534_CR114_534","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos PM, Xue Jue (1994) The maximum clique problem. J\u00a0Global Optim 4:301\u2013328","journal-title":"J. Global Optim."},{"key":"534_CR115_534","first-page":"71","volume":"5","author":"W.P. Pierskalla","year":"1967","unstructured":"Pierskalla WP (1967) The tri-substitution method for the three-multidimensional assignment problem. CORS J\n\t  5:71\u201381","journal-title":"CORS J."},{"key":"534_CR116_534","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"W.P. Pierskalla","year":"1968","unstructured":"Pierskalla WP (1968) The multidimensional assignment problem. Oper Res 16:422\u2013431","journal-title":"Oper. Res."},{"key":"534_CR117_534","unstructured":"Pitsoulis LS (1998) Algorithms for\n\tnonlinear assignment problems. PhD Thesis, Dept. Industr. Systems Engin., Univ. Florida"},{"key":"534_CR118_534","series-title":"DIMACS 16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1090\/dimacs\/016\/16","volume-title":"Quadratic assignment and related problems","author":"A.B. Poore","year":"1994","unstructured":"Poore AB, Rijavec N (1994) Partitioning multiple data sets: multidimensional assignments and Lagrangian relaxation. In: Pardalos PM,\n\t  Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS vol\u00a016. Amer. Math. Soc., Providence, pp\u00a0317\u2013342"},{"key":"534_CR119_534","first-page":"422","volume":"16","author":"J. Pusztaszeri","year":"1995","unstructured":"Pusztaszeri J, Rensing PE, Liebling TM (1995) Tracking elementary particles near their primary vertex: A\u00a0combinatorial\n\t  approach. J\u00a0Global Optim 16:422\u2013431","journal-title":"J. Global Optim."},{"key":"534_CR120_534","first-page":"256","volume-title":"Advances in Optimization","author":"L. Qi","year":"1994","unstructured":"Qi L, Balas E, Gwan G (1994) A\u00a0new facet class and a\u00a0polyhedral method for the three-index assignment problem. In: Du D-Z\n\t  (ed) Advances in Optimization. Kluwer, Dordrecht, pp\u00a0256\u2013274"},{"key":"534_CR121_534","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6377(86)90007-6","volume":"4","author":"M. Queyranne","year":"1986","unstructured":"Queyranne M (1986) Performance ratio of heuristics for triangle inequality quadratic assignment problems. Oper Res Lett\n\t  4:231\u2013234","journal-title":"Oper. Res. Lett."},{"key":"534_CR122_534","series-title":"Res. and Exposition in Math.","volume-title":"The linear ordering problem: Algorithms and applications","author":"G. Reinelt","year":"1985","unstructured":"Reinelt G (1985) The linear ordering problem: Algorithms and applications Res and Exposition in Math, vol\u00a08. Heldermann,\n\t  Berlin"},{"key":"534_CR123_534","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0377-2217(85)90009-8","volume":"20","author":"F. Rendl","year":"1985","unstructured":"Rendl F (1985) Ranking scalar products to improve bounds for the quadratic assignment problem. Europ J Oper Res\n\t  20:363\u2013372","journal-title":"Europ. J. Oper. Res."},{"key":"534_CR124_534","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01585694","volume":"53","author":"F. Rendl","year":"1992","unstructured":"Rendl F, Wolkowicz H (1992) Applications of parametric programming and eigenvalue maximization to the quadratic assignment\n\t  problem. Math Program 53:63\u201378","journal-title":"Math. Program."},{"key":"534_CR125_534","series-title":"DIMACS 35","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1090\/dimacs\/035\/11","volume-title":"The Satisfiability Problem","author":"M.G.C. Resende","year":"1997","unstructured":"Resende MGC, Pitsoulis LS, Pardalos PM (1997) Approximate solution of weighted MAX-SAT problems using GRASP. In: Pardalos PM Resende\n\t  MGC, Du DZ (eds) The Satisfiability Problem. DIMACS vol\u00a035. Amer. Math. Soc., Providence, pp\u00a0393\u2013405"},{"key":"534_CR126_534","first-page":"197","volume":"4","author":"W.T. Rhee","year":"1989","unstructured":"Rhee WT (1989) A\u00a0note on asymptotic properties of the quadratic assigment problem. Oper Res Lett\n\t  4:197\u2013200","journal-title":"Oper. Res. Lett."},{"key":"534_CR127_534","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/moor.16.2.223","volume":"2","author":"W.T. Rhee","year":"1991","unstructured":"Rhee WT (1991) Stochastic analysis of the quadratic assignment problem. Math Oper Res 2:223\u2013239","journal-title":"Math. Oper. Res."},{"key":"534_CR128_534","first-page":"183","volume":"32","author":"C. Roucairol","year":"1979","unstructured":"Roucairol C (1979) A\u00a0reduction method for quadratic assignment problems. Oper Res Verfahren 32:183\u2013187","journal-title":"Oper. Res. Verfahren"},{"key":"534_CR129_534","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J\u00a0ACM 23:555\u2013565","journal-title":"J. ACM"},{"key":"534_CR130_534","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer AA, Yannakakis M (1991) Simple local search problems that are hard to solve. SIAM J Comput\n\t  20:56\u201387","journal-title":"SIAM J. Comput."},{"issue":"1","key":"534_CR131_534","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2(1):33\u201345","journal-title":"ORSA J. Comput."},{"key":"534_CR132_534","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1080\/02331939508844086","volume":"33","author":"W. Szpankowski","year":"1995","unstructured":"Szpankowski W (1995) Combinatorial optimization problems for which almost every algorithm is asymptotically optimal! Optim\n\t  33:359\u2013367","journal-title":"Optim."},{"key":"534_CR133_534","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard E (1991) Robust tabu search for the quadratic assignment problem. Parallel Comput 17:443\u2013455","journal-title":"Parallel Comput."},{"key":"534_CR134_534","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0305-0548(93)E0020-T","volume":"22","author":"D.M. Tate","year":"1995","unstructured":"Tate DM, Smith AE (1995) A\u00a0genetic approach to the quadratic assignment problem. Comput Oper Res\n\t  22:73\u201383","journal-title":"Computers Oper. Res."},{"key":"534_CR135_534","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. \u0108ern\u00fd","year":"1985","unstructured":"\u0108ern\u00fd V (1985) Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J\u00a0Optim\n\t  Th Appl 45:41\u201351","journal-title":"J. Optim. Th. Appl."},{"issue":"1","key":"534_CR136_534","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/07408178708975376","volume":"19","author":"M.R. Wilhelm","year":"1987","unstructured":"Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IEEE Trans\n\t  19(1):107\u2013119","journal-title":"IEEE Trans."},{"key":"534_CR137_534","unstructured":"Zhao Q (1996) Semidefinite\n\tprogramming for assignment and partitioning problems. PhD Thesis, Univ. Waterloo"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:52:57Z","timestamp":1720691577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_534"}},"subtitle":["QAP"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":140,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_534","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}