Quadratic Assignment Problems

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

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

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

[4]  Rainer E. Burkard,et al.  Probabilistic asymptotic properties of some combinatorial optimization problems , 1985, Discret. Appl. Math..

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

[6]  Ernest J. McCormick,et al.  Human Factors Engineering , 1985 .

[7]  Alexander H. G. Rinnooy Kan,et al.  Asymptotic Properties of the Quadratic Assignment Problem , 1985, Math. Oper. Res..

[8]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[10]  Michael Jünger,et al.  Polyhedral combinatorics and the acyclic subdigraph problem , 1985 .

[11]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[12]  Egon Balas,et al.  Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..

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

[14]  Charles R. Johnson,et al.  Positive definite completions of partial Hermitian matrices , 1984 .

[15]  Egon Balas,et al.  Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..

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

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

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

[19]  M. Bazaraa,et al.  A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .

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

[21]  Alan M. Frieze,et al.  On the quadratic assignment problem , 1983, Discret. Appl. Math..

[22]  Rainer E. Burkard,et al.  On random quadratic bottleneck assignment problems , 1982, Math. Program..

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

[24]  John R. Beaumont,et al.  Studies on Graphs and Discrete Programming , 1982 .

[25]  Rainer E. Burkard,et al.  Combinatorial optimization in linearly ordered semimodules: A survey , 1982 .

[26]  Shahid H. Bokhari,et al.  A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System , 1981, IEEE Transactions on Software Engineering.

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

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

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

[30]  H. Sherali,et al.  Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .

[31]  C. S. Edwards.  A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem , 1980 .

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

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

[34]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

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

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

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

[38]  Jakob Krarup,et al.  Computer-aided layout design , 1978 .

[39]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

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

[41]  Rainer E. Burkard,et al.  An algebraic approach to assignment problems , 1977, Math. Program..

[42]  Shaul P. Ladany,et al.  Optimal strategies in sports , 1977 .

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

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

[45]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

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

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

[48]  Nicos Christofides,et al.  Special Cases of the Quadratic Assignment Problem , 1976 .

[49]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[50]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[51]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

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

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

[54]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[55]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

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

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

[59]  Harold Greenberg,et al.  A quadratic assignment problem without column constraints , 1969 .

[60]  Katta G. Murty,et al.  Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..

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

[62]  K. G. Murty.  An Algorithm for Ranking All the Assignment in Order of Increasing Cost , 1968 .

[63]  W. Leontief.  Input-output economics , 1967 .

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

[65]  Robin B. S. Brooks,et al.  A Mathematical Model of Supply Support for Space Operations , 1966, Oper. Res..

[66]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[67]  A. H. Land,et al.  A Problem of Assignment with Inter-Related Costs , 1963 .

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

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

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

[71]  L. Mirsky,et al.  The spread of a matrix , 1956 .

[72]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[73]  H. Wiener.  Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.