Skip to main content
SpringerLink
Log in

Quadratic Assignment Problem

QAP

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Formulations

Linearizations

  Lawler's Linearization

  Kaufman–Broeckx Linearization

  Frieze–Yadegar Linearization

  Adams–Johnson Linearization

Complexity Issues

  Computational Complexity

  PLS-Complexity

  Asymptotic Behavior

  Polynomially Solvable Cases

Lower Bounds

  Gilmore–Lawler Type Lower Bounds

  Variance Reduction Lower Bounds

  Eigenvalue Based Lower Bounds

  Bounds Based on Semidefinite Relaxations

Exact Solution Methods

  Branch and Bound

  Traditional Cutting Plane Methods

  Polyhedral Cutting Planes

Heuristics

  Construction Methods

  Limited Enumeration Methods

  Improvement Methods

  Tabu Search

  Simulated Annealing

  Genetic Algorithms

  Greedy Randomized Adaptive Search Procedure

  Ant Systems

Related Problems

  Biquadratic Assignment Problem

  Multidimensional Assignment Problems

  Bottleneck QAP

  Other Problems Which Can Be Formulated As QAPs

QAP Problem Generators

Surveys and Books

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aarts E, Lenstra JK (eds) (1997) Local search in combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  2. Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic Assignment and Related Problems. DIMACS. Amer. Math. Soc., Providence, pp 43–75

    Google Scholar 

  3. Adams WP, Sherali HD (1986) A tight linearization and an algorithm for zero-one quadratic programming problems. Managem Sci 32(10):1274–1290

    MATH  MathSciNet  Google Scholar 

  4. Adams WP, Sherali HD (1990) Linearization strategies for a class of zero-one mixed integer programming problems. Oper Res 38(2):217–226

    MATH  MathSciNet  Google Scholar 

  5. Ahuja RK, Orlin JB, Tivari A (1995) A greedy genetic algorithm for the quadratic assignment problem. Techn Report 3826-95, Sloan School Management

    Google Scholar 

  6. Arora S, Frieze A, Kaplan H (1996) A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In: Proc. 37-th Annual IEEE Symp. Foundations of Computer Sci. (FOCS). IEEE, New York, pp 21–30

    Google Scholar 

  7. Balas E, Mazzola JB (1980) Quadratic 0-1 programming by a new linearization. In: Proc TIMS/ORSA, May 1980

    Google Scholar 

  8. Balas E, Mazzola JB (1984) Nonlinear programming: I. Linearization techniques. Math Program 30:1–21

    Article  MATH  MathSciNet  Google Scholar 

  9. Balas E, Mazzola JB (1984) Nonlinear programming: II. Dominance relations and algorithms. Math Program 30:22–45

    Article  MATH  MathSciNet  Google Scholar 

  10. Balas E, Qi L (1993) Linear-time separation algorithms for the three-index assignment polytope. Discrete Appl Math (1993):1–12

    Google Scholar 

  11. Balas E, Saltzman MJ (1989) Facets of the three-index assignment polytope. Discrete Appl Math (1989):201–229

    Google Scholar 

  12. Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput (1994):126–140

    Google Scholar 

  13. Bazaraa MS, Sherali HD (1980) Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res Logist Quart 27:29–41

    Article  MATH  MathSciNet  Google Scholar 

  14. Bazaraa MS, Sherali HD (1982) On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. J Oper Res Soc 33:991–1003

    Article  MATH  MathSciNet  Google Scholar 

  15. Birkoff G (1946) Tres observaciones sobre el algebra lineal. Univ Nac Tucuman Rev (A):147–151

    Google Scholar 

  16. Bollobás B (1978) Extremal graph theory. Acad. Press, New York

    MATH  Google Scholar 

  17. Buffa ES, Armour GC, Vollmann TE (1962) Allocating facilities with CRAFT. Harvard Business Rev 42:136–158

    Google Scholar 

  18. Burkard RE (1973) Die Störungsmethode zur Lösung quadratischer Zuordnungsprobleme. Oper Res Verfahren 16:84–108

    Google Scholar 

  19. Burkard RE (1974) Quadratische Bottleneckprobleme. Oper Res Verfahren 18:26–41

    MathSciNet  Google Scholar 

  20. Burkard RE (1991) Locations with spatial interactions: the quadratic assignment problem. In: Mirchandani PB, Francis RL (eds) Discrete Location Theory. Wiley, New York

    Google Scholar 

  21. Burkard RE, Bönniger T (1983) A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. Europ J Oper Res 13:374–386

    Article  MATH  Google Scholar 

  22. Burkard RE, Çela E (1995) Heuristics for biquadratic assignment problems and their computational comparison. Europ J Oper Res 83:283–300

    Article  MATH  Google Scholar 

  23. Burkard RE, Çela E, Demidenko VM, Metelski NN, Woeginger GJ (1997) Perspectives of easy and hard cases of the quadratic assignment problems. Techn Report SFB 104, Techn Univ Graz

    Google Scholar 

  24. Burkard RE, Çela E, Klinz B (1994) On the biquadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS. Amer. Math. Soc., Providence, pp 117–146

    Google Scholar 

  25. Burkard RE, Çela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. In: Du D-Z and Pardalos PM (eds) Handbook Combinatorial Optim., vol 3. Kluwer, Dordrecht, pp 241–337

    Google Scholar 

  26. Burkard RE, Çela E, Rote G, Woeginger GJ (1995) The quadratic assignment problem with an Anti-Monge and a Toeplitz matrix: Easy and hard cases. Techn Report SFB 34, Techn Univ Graz

    Google Scholar 

  27. Burkard RE, Fincke U (1982) On random quadratic bottleneck assignment problems. Math Program 23:227–232

    Article  MATH  MathSciNet  Google Scholar 

  28. Burkard RE, Fincke U (1983) The asymptotic probabilistic behaviour of quadratic sum assignment problems. Z Oper Res 27:73–81

    Article  MATH  MathSciNet  Google Scholar 

  29. Burkard RE, Fincke U (1985) Probabilistic asymptotic properties of some combinatorial optimization problems. Discrete Appl Math 12:21–29

    Article  MATH  MathSciNet  Google Scholar 

  30. Burkard RE, Hahn W, Zimmermann U (1977) An algebraic approach to assignment problems. Math Program 12:318–327

    Article  MATH  MathSciNet  Google Scholar 

  31. Burkard RE, Karisch S, Rendl F (1997) QAPLIB – Aquadratic assignment problem library. J Global Optim 10:391–403

    Article  MATH  MathSciNet  Google Scholar 

  32. Burkard RE, Klinz B, Rudolf R (1996) Perspectives of Monge properties in optimization. Discrete Appl Math 70:95–161

    Article  MATH  MathSciNet  Google Scholar 

  33. Burkard RE, Rendl F (1984) A thermodynamically motivated simulation procedure for combinatorial optimization problems. Europ J Oper Res 17:169–174

    Article  MATH  Google Scholar 

  34. Burkard RE, Zimmermann U (1982) Combinatorial optimization in linearly ordered semimodules: A survey. Modern Applied Mathematics. North-Holland, Amsterdam, pp 392–436

    Google Scholar 

  35. Çela E (1998) The quadratic assignment problem: Theory and algorithms. Kluwer, Dordrecht

    MATH  Google Scholar 

  36. Chakrapani J, Skorin-Kapov J (1993) Massively parallel tabu search for the quadratic assignment problem. Ann Oper Res 41:327–342

    Article  MATH  Google Scholar 

  37. Christofides N (1976) Worst case analysis of a new heuristic for the traveling salesman problem. Grad School Industr Admin Carnegie-Mellon Univ 338

    Google Scholar 

  38. Colorni A, Dorigo M, Maniezzo V (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst, Man Cybern Part B 26:29–41

    Article  Google Scholar 

  39. Colorni A, Maniezzo V (1998) The ant system applied to the quadratic assignment problem. IEEE Trans Knowledge and Data Enginto

    Google Scholar 

  40. Connolly DT (1990) An improved annealing scheme for the QAP. Europ J Oper Res 46:93–100

    Article  MATH  MathSciNet  Google Scholar 

  41. Conrad K (1971) Das quadratische Zuweisungsproblem und zwei seiner Spezialfalle. Mohr-Siebeck, Tübingen

    Google Scholar 

  42. Cyganski D, Vaz RF, Virball VG (1994) Quadratic assignment problems with the Palubeckis' algorithm are degenerate. IEEE Trans Circuits and Systems I 41:481–484

    Article  MathSciNet  Google Scholar 

  43. Davis L (1987) Genetic algorithms and simulated annealing. Pitman, Boston

    MATH  Google Scholar 

  44. Deneko VG, Woeginger GJ (1996) A solvable case of the quadratic assignment problem. Techn Report SFB 88,Inst Math, Techn Univ Graz

    Google Scholar 

  45. Dorigo M (1992) Optimization, learning, and natural algorithms. PhD Thesis, Dip. Elettronica e Informazione Politecn. Milano. (In Italian)

    Google Scholar 

  46. Dyer ME, Frieze AM, McDiarmid CJH (1986) On linear programs with random costs. Math Program 35:3–16

    Article  MATH  MathSciNet  Google Scholar 

  47. Edwards CS (1980) A branch and bound algorithm for the Koopmans–Beckman quadratic assignment problem. Math Program Stud 13:35–52

    MATH  Google Scholar 

  48. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109–133

    Article  MATH  MathSciNet  Google Scholar 

  49. Feo TA, Resende MGC, Smith SH (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42:860–878

    MATH  Google Scholar 

  50. Finke G, Burkard RE, Rendl F (1984) Eigenvalue approach to quadratic assignment problems. In: 5th Symp. Oper. Res., 1984

    Google Scholar 

  51. Finke G, Burkard RE, Rendl F (1987) Quadratic assignment problems. Ann Discret Math 31:61–82

    MathSciNet  Google Scholar 

  52. Fleurent C, Ferland J (1994) Genetic hybrids for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS. Amer. Math. Soc., Providence pp 43–75

    Google Scholar 

  53. Floudas CA, Pardalos PM (1990) A collection of test problems for constrained global optimization algorithms. Lecture Notes Computer Sci, vol 455. Springer, Berlin

    MATH  Google Scholar 

  54. Frenk JCB, van Houweninge M and, Rinnooy Kan AHG (1985) Asymptotic properties of assignment problems. Math Oper Res 10:100–116

    MATH  MathSciNet  Google Scholar 

  55. Frieze AM (1974) A bilinear programming formulation of the 3-dimensional assignment problem. Math Program 7:376–379

    Article  MATH  MathSciNet  Google Scholar 

  56. Frieze AM, Yadegar J (1983) On the quadratic assignment problem. Discrete Appl Math 5:89–98

    Article  MATH  MathSciNet  Google Scholar 

  57. Gambardella LM, Taillard ED, Dorigo M (1997) Ant colonies for the QAP. Techn Report IDSIA-4-97, Ist dalle Molle Di Studi sull'Intelligenza Artificiale Lugano

    Google Scholar 

  58. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  59. Gavett JW, Plyter NV (1966) The optimal assignment of facilities to locations by branch and bound. Oper Res 14:210–232

    Google Scholar 

  60. Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math 10:305–313

    Article  MATH  MathSciNet  Google Scholar 

  61. (1993) Tabu search. Ann Oper Res 41

    Google Scholar 

  62. Glover F (1989) Tabu search – Part I. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  63. Glover F (1990) Tabu search – Part II. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  64. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  65. Hadley SW (1989) Continuous optimization approaches for the quadratic assignment problem. PhD Thesis, Univ. Waterloo

    Google Scholar 

  66. Hadley SW, Rendl F, Wolkowicz H (1990) Bounds for the quadratic assignment problem using continuous optimization techniques. Integer Programming and Combinatorial Optimization. Univ. Waterloo Press, Waterloo, pp 237–248

    Google Scholar 

  67. Hadley SW, Rendl F, Wolkowicz H (1992) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17(3):727–739

    MATH  MathSciNet  Google Scholar 

  68. Hadley SW, Rendl F, Wolkowicz H (1992) Nonsymmetric quadratic assignment problems and the Hoffman–Wielandt Inequality. Linear Alg & its Appl 58:109–124

    MathSciNet  Google Scholar 

  69. Hardy GG, Littlewood JE, Polya G (1952) Inequalities. Cambridge Univ. Press, Cambridge

    MATH  Google Scholar 

  70. Heider CH (1972) A computationally simplified pair exchange algorithm for the quadratic assignment problem. Paper 101, Center Naval Anal, Arlington

    Google Scholar 

  71. Jansen B (1993) A note on lower bounds for the QAP. Techn Report (dec), Delft Univ Techn Math and Computer Sci

    Google Scholar 

  72. Johnson DS, Papadimitriou CH, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79–100

    Article  MATH  MathSciNet  Google Scholar 

  73. Johnson TA (1992) New linear programming-based solution procedures for the quadratic assignment problem. PhD Thesis, Clemson Univ.

    Google Scholar 

  74. Jünger M (1985) Polyhedral combinatorics and the acyclic subdigraph problem. Heldermann, Berlin

    MATH  Google Scholar 

  75. Kaibel V (1997) Polyhedral combinatorics of the quadratic assignment problem. PhD Thesis, Univ. Köln

    Google Scholar 

  76. Karisch SE (1995) Nonlinear approaches for quadratic assignment and graph partition problems. PhD Thesis, Techn. Univ. Graz

    Google Scholar 

  77. Karisch SE, Rendl F, Wolkowicz H, Zhao Q (1998) Semidefinite programming relaxations for the quadratic assignment problem. J Combin Optim 2(1):71–109

    Article  MATH  MathSciNet  Google Scholar 

  78. Karisch SE, Rendl F, Wolkowicz H (1994) Trust regions and the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS. Amer. Math. Soc., Providence, pp 199–220

    Google Scholar 

  79. Karp R (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Proc. Complexity of Computer Computations. Plenum, New York, pp 85–104

    Google Scholar 

  80. Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Benders' decomposition. Europ J Oper Res 2:204–211

    Article  Google Scholar 

  81. Kernighan B, Lin S (1972) An efficient heuristic procedure for partitioning graphs. Bell Systems J 49:291–307

    Google Scholar 

  82. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  83. Klincewicz JG (1992) Avoiding local optima in the p-hub location problem using tabu search and GRASP. Ann Oper Res 40:283–302

    Article  MATH  MathSciNet  Google Scholar 

  84. Klincewicz JG, Rajan A (1992) Using GRASPto solve the component grouping problem. Techn Report, AT&T Bell Lab

    Google Scholar 

  85. Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25:53–76

    Article  MATH  MathSciNet  Google Scholar 

  86. Land AM (1963) A problem of assignment with interrelated costs. Oper Res Quart 14:185–198

    Google Scholar 

  87. Laporte G, Mercure H (1988) Balancing hydraulic turbine runners: A quadratic assignment problem. Europ J Oper Res 35:378–382

    Article  Google Scholar 

  88. Lawler EL (1963) The quadratic assignment problem. Managem Sci 9:586–599

    MATH  MathSciNet  Google Scholar 

  89. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1985) The traveling salesman problem: A guided tour of combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  90. Lengauer T (1990) Combinatorial algorithms for intergrated circuit layout. Wiley, New York

    Google Scholar 

  91. Leontief W (1966) Input–output economics. Oxford Univ. Press, Oxford

    Google Scholar 

  92. Li Y, Pardalos PM (1992) Generating quadratic assignment test problems with known optimal permutations. Comput Optim Appl 1(2):163–184

    Article  MATH  MathSciNet  Google Scholar 

  93. Li Y, Pardalos PM, Ramakrishnan KG, Resende MGC (1994) Lower bounds for the quadratic assignment problem. Ann Oper Res 50:387–410

    Article  MATH  MathSciNet  Google Scholar 

  94. Li Y, Pardalos PM, Resende MGC (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS 16. Amer. Math. Soc., Providence, pp 237–261

    Google Scholar 

  95. Mavridou T, Pardalos PM, Pitsoulis LS, Resende MGC (1998) A GRASPfor the biquadratic assignment problem. Europ J Oper Res 105(3):613–621

    Article  MATH  Google Scholar 

  96. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21:1087–1092

    Article  Google Scholar 

  97. Mirchandani PB, Obata T (1979) Locational decisions with interactions between facilities: the quadratic assignment problem a review. Working Paper May Ps-79-1, Rensselaer Polytechnic Inst, Troy, New York

    Google Scholar 

  98. Mirsky L (1956) The spread of a matrix. Mathematika 3:127–130

    Article  MATH  MathSciNet  Google Scholar 

  99. Mosevich J (1986) Balancing hydraulic turbine runners – a discrete combinatorial optimization problem. Europ J Oper Res 26:202–204

    Article  MATH  Google Scholar 

  100. Muller-Merbach H (1970) Optimale Reihenlorgen. Springer, Berlin

    Google Scholar 

  101. Murphey RA, Pardalos PM, Pitsoulis L (1997) A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In: Pardalos PM, Du D-Z (eds) Network Design: Connectivity and Facility Location. DIMACS 40. Amer. Math. Soc., Providence, pp 277–302

    Google Scholar 

  102. Murphey RA, Pardalos PM, Pitsoulis L (1998) A parallel GRASP for the data association multidimensional assignment problem. Parallel Processing of Discrete Problems. In: IMA vol Math Appl, vol 106. Springer, Berlin, pp 159–180

    Google Scholar 

  103. Murthy KA, Pardalos PM, Li Y (1992) A local search algorithm for the quadratic assignment problem. Informatica 3(4):524–538

    MATH  MathSciNet  Google Scholar 

  104. Murty KG (1968) An algorithm for ranking all the assignments in order of increasing cost. Oper Res 16:682–287

    MATH  Google Scholar 

  105. Nugent CE, Vollmann TE, Ruml J (1969) An experimental comparison of techniques for the assignment of facilities to locations. J Oper Res 16:150–173

    Article  Google Scholar 

  106. Padberg MW, Rijal MP (1996) Location, scheduling, design and integer programming. Kluwer, Dordrecht

    MATH  Google Scholar 

  107. Palubetskis GS (1988) Generation of quadratic assignment test problems with known optimal solutions. Zh Vychisl Mat Mat Fiz 28(11):1740–1743. (In Russian.)

    MATH  MathSciNet  Google Scholar 

  108. Papadimitriou CH, Wolfe D (1985) The complexity of facets resolved. In: Proc Foundations Computer Sci, pp 74–78

    Google Scholar 

  109. Pardalos PM, Pitsoulis LS, Resende MGC (1995) A parallel GRASP implementation for solving the quadratic assignment problem. In: Ferreira A and Rolim JDP (eds) Parallel Algorithms for Irregular Problems: State of the Art. Kluwer, Dordrecht, pp 115–133

    Google Scholar 

  110. Pardalos PM, Pitsoulis LS, Resende MGC (1997) Algorithm 769: FORTRAN subroutines for approximate solution of sparse quadratic assignment problems. ACM Trans Math Softw 23:196–208

    Article  MATH  MathSciNet  Google Scholar 

  111. Pardalos PM, Ramakrishnan KG, Resende MGC, Li Y (1997) Implementation of a variable reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem. SIAM J Optim 7(1):280–294

    Article  MATH  MathSciNet  Google Scholar 

  112. Pardalos PM, Rendl F, Wolkowicz H (1994) The quadratic assignment problem: A survey and recent developments. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS vol 16. Amer. Math. Soc., Providence, pp 1–42

    Google Scholar 

  113. Pardalos PM, Wolkowicz H (1994) Quadratic assignment and related problems. DIMACS, vol 16. Amer. Math. Soc., Providence

    MATH  Google Scholar 

  114. Pardalos PM, Xue Jue (1994) The maximum clique problem. J Global Optim 4:301–328

    Article  MATH  MathSciNet  Google Scholar 

  115. Pierskalla WP (1967) The tri-substitution method for the three-multidimensional assignment problem. CORS J 5:71–81

    Google Scholar 

  116. Pierskalla WP (1968) The multidimensional assignment problem. Oper Res 16:422–431

    MATH  Google Scholar 

  117. Pitsoulis LS (1998) Algorithms for nonlinear assignment problems. PhD Thesis, Dept. Industr. Systems Engin., Univ. Florida

    Google Scholar 

  118. Poore AB, Rijavec N (1994) Partitioning multiple data sets: multidimensional assignments and Lagrangian relaxation. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS vol 16. Amer. Math. Soc., Providence, pp 317–342

    Google Scholar 

  119. Pusztaszeri J, Rensing PE, Liebling TM (1995) Tracking elementary particles near their primary vertex: A combinatorial approach. J Global Optim 16:422–431

    Google Scholar 

  120. Qi L, Balas E, Gwan G (1994) A new facet class and a polyhedral method for the three-index assignment problem. In: Du D-Z (ed) Advances in Optimization. Kluwer, Dordrecht, pp 256–274

    Google Scholar 

  121. Queyranne M (1986) Performance ratio of heuristics for triangle inequality quadratic assignment problems. Oper Res Lett 4:231–234

    Article  MATH  MathSciNet  Google Scholar 

  122. Reinelt G (1985) The linear ordering problem: Algorithms and applications Res and Exposition in Math, vol 8. Heldermann, Berlin

    MATH  Google Scholar 

  123. Rendl F (1985) Ranking scalar products to improve bounds for the quadratic assignment problem. Europ J Oper Res 20:363–372

    Article  MATH  MathSciNet  Google Scholar 

  124. Rendl F, Wolkowicz H (1992) Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math Program 53:63–78

    Article  MATH  MathSciNet  Google Scholar 

  125. Resende MGC, Pitsoulis LS, Pardalos PM (1997) Approximate solution of weighted MAX-SAT problems using GRASP. In: Pardalos PM Resende MGC, Du DZ (eds) The Satisfiability Problem. DIMACS vol 35. Amer. Math. Soc., Providence, pp 393–405

    Google Scholar 

  126. Rhee WT (1989) A note on asymptotic properties of the quadratic assigment problem. Oper Res Lett 4:197–200

    Google Scholar 

  127. Rhee WT (1991) Stochastic analysis of the quadratic assignment problem. Math Oper Res 2:223–239

    MathSciNet  Google Scholar 

  128. Roucairol C (1979) A reduction method for quadratic assignment problems. Oper Res Verfahren 32:183–187

    MATH  Google Scholar 

  129. Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23:555–565

    Article  MATH  MathSciNet  Google Scholar 

  130. Schäffer AA, Yannakakis M (1991) Simple local search problems that are hard to solve. SIAM J Comput 20:56–87

    Article  MATH  MathSciNet  Google Scholar 

  131. Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2(1):33–45

    MATH  Google Scholar 

  132. Szpankowski W (1995) Combinatorial optimization problems for which almost every algorithm is asymptotically optimal! Optim 33:359–367

    Article  MATH  MathSciNet  Google Scholar 

  133. Taillard E (1991) Robust tabu search for the quadratic assignment problem. Parallel Comput 17:443–455

    Article  MathSciNet  Google Scholar 

  134. Tate DM, Smith AE (1995) A genetic approach to the quadratic assignment problem. Comput Oper Res 22:73–83

    Article  MATH  Google Scholar 

  135. Ĉerný V (1985) Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J Optim Th Appl 45:41–51

    Article  MATH  Google Scholar 

  136. Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IEEE Trans 19(1):107–119

    Article  Google Scholar 

  137. Zhao Q (1996) Semidefinite programming for assignment and partitioning problems. PhD Thesis, Univ. Waterloo

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Princeton University, Princeton, USA

    Leonidas Pitsoulis

  2. Center for Applied Optim. Department Industrial and Systems Engineering, University Florida, Gainesville, USA

    Panos M. Pardalos

Authors
  1. Leonidas Pitsoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Pitsoulis, L., Pardalos, P.M. (2008). Quadratic Assignment Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_534

Download citation

Publish with us

Policies and ethics

Search

Navigation