The Quadratic Assignment Problem: A Survey and Recent Developments

Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing , and combinatorial data analysis. In this paper we survey some of the most important techniques, applications, and methods regarding the quadratic assignment problem. We focus our attention on recent developments .

[1]  K. Fan,et al.  Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators. , 1951, Proceedings of the National Academy of Sciences of the United States of America.

[2]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .

[3]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[4]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[5]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[6]  Giuseppe Avondo Bodino,et al.  Economic applications of the theory of graphs , 1962 .

[7]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[8]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[9]  G.L.E. Metz.  Economic Applications of the Theory of Graphs , 1964 .

[10]  William L. Maxwell,et al.  The scheduling of economic lot sizes , 1964 .

[11]  P. Camion.  Characterization of totally unimodular matrices , 1965 .

[12]  C. Carl Pegels.  PLANT LAYOUT AND DISCRETE OPTIMIZING , 1966 .

[13]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[14]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[15]  S. Senju,et al.  An Approach to Linear Programming with 0--1 Variables , 1968 .

[16]  Robert E. Echols,et al.  Solution of Integer Linear Programming Problems by Direct Search , 1968, JACM.

[17]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[18]  Frederick S. Hillier,et al.  Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..

[19]  M. Raghavachari,et al.  On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints , 1969, Oper. Res..

[20]  Arthur M. Geoffrion,et al.  An Improved Implicit Enumeration Approach for Integer Programming , 1969, Oper. Res..

[21]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[22]  Jack Minker,et al.  An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[23]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[24]  James Turner,et al.  A Survey of Progress in Graph Theory in the Soviet Union , 1970 .

[25]  Richard H. Roth.  An Approach to Solving Linear Discrete Optimization Problems , 1970, JACM.

[26]  K. Conrad.  Das quadratische Zuweisungsproblem und zwei seiner Spezialfaelle , 1971 .

[27]  John W. Dickey,et al.  Campus building arrangement using topaz , 1972 .

[28]  Maurice Hanan,et al.  A review of the placement and quadratic assignment problems , 1972 .

[29]  Fred W. Glover,et al.  Technical Note - A Note on Zero-One Integer and Concave Programming , 1972, Oper. Res..

[30]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[31]  Fred W. Glover,et al.  Concave Programming Applied to a Special Class of 0-1 Integer Programs , 1973, Oper. Res..

[32]  Bruce A. McCarl,et al.  A HEURISTIC FOR GENERAL INTEGER PROGRAMMING , 1974 .

[33]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[34]  Hisashi Mine,et al.  A heuristic algorithm for mixed-integer programming problems , 1974 .

[35]  Roger C. Vergin,et al.  Comparison of Computer Algorithms and Visual Based Methods for Plant Layout , 1975 .

[36]  一紀 正路.  Pennsylvania State Universityに留学して , 1975 .

[37]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[38]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[39]  J. Y. Wong,et al.  On Solving A One-Dimensional Space Allocation Problem With Integer Programming , 1976 .

[40]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[41]  J. Y. Wong,et al.  Solving quadratic assignment problems with rectangular distances and integer programming , 1976 .

[42]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[43]  Robert Sedgewick,et al.  Permutation Generation Methods , 1977, CSUR.

[44]  Rainer E. Burkard,et al.  Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..

[45]  A. N. Elshafei,et al.  Hospital Layout as a Quadratic Assignment Problem , 1977 .

[46]  R. Burkard,et al.  Numerical investigations on quadratic assignment problems , 1978 .

[47]  L. Kaufman,et al.  An algorithm for the quadratic assignment problem using Bender's decomposition , 1978 .

[48]  S. Goto,et al.  All approach to the two-dimensional placement problem in circuit layout , 1978 .

[49]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[50]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[51]  C. Roucairol.  Un nouvel algorithme pour le problème d'affectation quadratique , 1979 .

[52]  Frederick S. Hillier,et al.  Interior Path Methods for Heuristic Integer Programming Procedures , 1979, Oper. Res..

[53]  C. Jochum,et al.  Neue Anwendungsgebiete für Computer in der Chemie , 1979 .

[54]  A. N. Elshafei,et al.  An exact branch‐and‐bound procedure for the quadratic‐assignment problem , 1979 .

[55]  Nicos Christofides,et al.  Contributions to the quadratic assignment problem , 1980 .

[56]  R. Burkard,et al.  Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[57]  R. S. Lashkari,et al.  A Heuristic Approach to Quadratic Assignment Problem , 1980 .

[58]  Nicos Christofides,et al.  A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem , 1981 .

[59]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[60]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[61]  Alan Frieze,et al.  An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice , 1981 .

[62]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[63]  Hanif D. Sherali,et al.  On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem , 1982 .

[64]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[65]  Christopher C. Skiscim,et al.  Optimization by simulated annealing: A preliminary computational study for the TSP , 1983, WSC '83.

[66]  R. Burkard,et al.  A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .

[67]  Martin Grötschel,et al.  Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[68]  David H. West,et al.  Algorithm 608: Approximate Solution of the Quadratic Assignment Problem , 1983, TOMS.

[69]  A. Frieze.  Complexity of a 3-dimensional assignment problem , 1983 .

[70]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[71]  Rainer E. Burkard,et al.  The asymptotic probabilistic behaviour of quadratic sum assignment problems , 1983, Z. Oper. Research.

[72]  R. Burkard.  Quadratic Assignment Problems , 1984 .

[73]  P. A. Bruijs.  On the quality of heuristic solutions to a 19 × 19 quadratic assignment problem , 1984 .

[74]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[75]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[76]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[77]  F. Rendl.  Ranking scalar products to improve bounds for the quadratic assignment problem , 1985 .

[78]  Gerhard Reinelt,et al.  The linear ordering problem: algorithms and applications , 1985 .

[79]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[80]  A. Assad,et al.  On lower bounds for a class of quadratic 0, 1 programs , 1985 .

[81]  J. P. Blanks.  Near-optimal quadratic-based placement for a class of IC layout problems , 1985, IEEE Circuits and Devices Magazine.

[82]  L. Hubert.  Assignment methods in combinatorial data analysis , 1986 .

[83]  Bruno Simeone,et al.  An asymptotically exact polynomial algorithm for equipartition problems , 1986, Discret. Appl. Math..

[84]  Franz Rendl,et al.  Quadratic assignment problems on series-parallel digraphs , 1986, Z. Oper. Research.

[85]  Jan Karel Lenstra,et al.  An introduction to parallelism in combinatorial optimization , 1986, Discret. Appl. Math..

[86]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[87]  J. B. Rosen,et al.  Methods for global concave minimization: A bibliographic survey , 1986 .

[88]  G. Thompson,et al.  An exact algorithm for the general quadratic assignment problem , 1986 .

[89]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[90]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[91]  Panos M. Pardalos.  Generation of large-scale quadratic programs for use as global optimization test problems , 1987, TOMS.

[92]  B. Gollan.  EIGENVALUE PERTURBATIONS AND NONLINEAR PARAMETRIC OPTIMIZATION , 1987 .

[93]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[94]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[95]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[96]  Catherine Roucairol,et al.  A parallel branch and bound algorithm for the quadratic assignment problem , 1987, Discret. Appl. Math..

[97]  R. Euler.  Odd cycles and a class of facets of the axial 3-index assignment polytope , 1987 .

[98]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[99]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[100]  Gerald L. Thompson,et al.  A Heuristic Algorithm for the Facilities Layout Problem , 1988 .

[101]  P. Pardalos,et al.  Checking local optimality in constrained quadratic programming is NP-hard , 1988 .

[102]  Wansoo T. Rhee.  A note on asymptotic properties of the quadratic assignment problem , 1988 .

[103]  Jonathan F. Bard,et al.  Note-Operations Sequencing in Discrete Parts Manufacturing , 1989 .

[104]  Graham K. Rand,et al.  Facilities Location: Models and Methods , 1989 .

[105]  W. Gander,et al.  A Constrained Eigenvalue Problem , 1989 .

[106]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[107]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[108]  Wing Shing Wong,et al.  A New Approach to Choosing Initial Points in Local Search , 1989, Inf. Process. Lett..

[109]  Panos M. Pardalos,et al.  A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[110]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[111]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[112]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[113]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[114]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[115]  Gintaras Palubeckis.  Quadratic 0-1 optimization , 1990 .

[116]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[117]  Narendra Karmarkar,et al.  An Interior-Point Approach to NP-Complete Problems , 1990, Conference on Integer Programming and Combinatorial Optimization.

[118]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[119]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

[120]  Karl-Heinz Hoffmann,et al.  Simulated annealing for single minimum optimization problems , 1991, Int. J. Comput. Math..

[121]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[122]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[123]  Rainer E. Burkard,et al.  Efficiently solvable special cases of bottleneck travelling salesman problems , 1991, Discret. Appl. Math..

[124]  T. Feo,et al.  An algorithm for the manufacturing equipment selection problem , 1991 .

[125]  Tao Li.  Parallel Imprecise Iterative Deepening for Combinatorial Optimization , 1991, Int. J. High Speed Comput..

[126]  Panos M. Pardalos,et al.  Quadratic programming with one negative eigenvalue is NP-hard , 1991, J. Glob. Optim..

[127]  Dirk Van Gucht,et al.  Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..

[128]  John E. Savage,et al.  Parallelism in Graph-Partitioning , 1991, J. Parallel Distributed Comput..

[129]  Michael Werman,et al.  The relationship between integer and real solutions of constrained convex programming , 1991, Math. Program..

[130]  Egon Balas,et al.  An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..

[131]  C. Fiechter,et al.  Basic Ideas of Tabu Search with an application to Travelling Salesman and Quadratic Assignment , 1992 .

[132]  Panos M. Pardalos,et al.  Computational Experience with Parallel Algorithms for solving the quadratic Assignment Problem , 1992, Computer Science and Operations Research.

[133]  S. Karisch.  Trust Regions and the Quadratic Assignment Problem , 1992 .

[134]  Liqun Qi,et al.  On facets of the three-index assignment polytope , 1992, Australas. J Comb..

[135]  Panos M. Pardalos,et al.  Complexity of uniqueness and local search in quadratic 0-1 programming , 1992, Oper. Res. Lett..

[136]  Franz Rendl,et al.  Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem , 1992, Math. Program..

[137]  Michael L. Overton,et al.  Large-Scale Optimization of Eigenvalues , 1990, SIAM J. Optim..

[138]  Panos M. Pardalos,et al.  A local search algorithm for the quadratic assignment problem , 1992 .

[139]  Yong Li.  Heuristic and exact algorithms for the quadratic assignment problem , 1992 .

[140]  Federico Malucelli,et al.  A New Lower Bound for the Quadratic Assignment Problem , 1992, Oper. Res..

[141]  Panos M. Pardalos,et al.  Topics in parallel computing in mathematical programming , 1993, Applied discrete mathematics and theoretical computer science.

[142]  Panos M. Pardalos,et al.  Generating quadratic assignment test problems with known optimal permutations , 1992, Comput. Optim. Appl..

[143]  Egon Balas,et al.  Linear-Time Separation Algorithms for the Three-Index Assignment Polytope , 1993, Discret. Appl. Math..

[144]  T. Lacksonen,et al.  Quadratic assignment algorithms for the dynamic layout problem , 1993 .

[145]  P. Pardalos.  Complexity in numerical optimization , 1993 .

[146]  Panos M. Pardalos,et al.  A computational comparison of local search heuristics for solving quadratic assignment problems , 1993 .

[147]  R. Burkard,et al.  Computational investigations on 3-dimensional axial assignment problems , 1993 .

[148]  Franz Rendl,et al.  A spectral approach to bandwidth and separator problems in graphs , 1993, IPCO.

[149]  Jadranka Skorin-Kapov,et al.  A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[150]  D. White.  A parametric‐based heuristic program for the quadratic assignment problem , 1993 .

[151]  Frits C. R. Spieksma,et al.  Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs , 1994, Discret. Appl. Math..

[152]  L. Qi,et al.  A NEW FACET CLASS AND A POLYHEDRAL METHOD FOR THE THREE-INDEX ASSIGNMENT PROBLEM , 1994 .

[153]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[154]  Bintong Chen.  Special cases of the quadratic assignment problem , 1995 .

[155]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..

[156]  José Luis González Velarde,et al.  The Intermodal Trailer Assignment Problem , 1995, Transp. Sci..

[157]  Henry Wolkowicz,et al.  Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations , 1995, SIAM J. Optim..

[158]  L. Muu.  Method for Minimizing a Convex-Concave Function over a Convex Set , .