extended Koopmans-Beckmann quadratic assignment problem
Gams: G2b

1

BAZARAA, M.S., AND ELSHAFEI, A.N. An exact branch-and-bound procedure for the quadratic assignment problem. Nay. Res. Logist. Q. 26 (1979), 109-121.

2

BURKARD, R.E., AND BONNIGER, T. A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. Eur. J. Oper. Res. 12 (1983), to be published.

3

R. E. Burkhard , U. Derigs, Assignment and Matching Problems: Solution Methods with FORTRAN-Programs, Springer-Verlag New York, Inc., Secaucus, NJ, 1980

4

BURKARD, R.E., AND RENDL, F. A thermodynamically motivated simulation procedure for combinatorial optimization problems. Bericbt 83-12, Technische Universitfit Graz und Universit~it Graz, Institute flit Matbematik, 1983.

5

BURKARD, R.E., AND STRATMANN, K.-H. Numerical investigations on quadratic assignment problems. Nay. Res. Logist. Q. 25 (1978), 129-148.

6

CHRISTOFIDES, N., MINGOZZI, A., AND TOTH, P. Contributions to the quadratic assignment problem. Eur. J. Oper. Res. 4 (1980), 243-247.

7

GRAVES, G.W., AND WHINSTON, A.B. An algorithm for the quadratic assignment problem. Manage. Sci. 16 (1970), 453-471.

8

HEIDER, C.H. An N-step, 2-variable search algorithm for the component placement problem. Nay. Res. Logist. Q. 20 (1973), 699-724.

9

KOOPMANS, T.C., AND BECKMANN, M.J. Assignment problems and the location of economic activities. Econometrica 25 (1957), 53-76.

10

KRARUP, J. Unpublished data, obtained via R. E. Burkard, private communication.

11

MULLER-MERBACH, H. Optimale Reihenfolgen. Springer, Berlin, 1970, pp. 158-171.

12

NUGENT, C.E., VOLLMANN, T.E., AND RUML, d. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16 (1968), 156-173.

13

PARKER, C.S. An experimental investigation of some heuristic strategies for component placement. Oper. Res. Q. 27 (1976), 71-81.

14

RYDER, B.G. The PFORT verifier. Softw. Pract. Exper. 4 (1974), 359-377.

15

STEINBERG, L. The backboard wiring problem: A placement algorithm. SIAM Rev. 3 (1961), 37- 50.

P. M. Pardalos , J. V. Crouse, A parallel algorithm for the quadratic assignment problem, Proceedings of the 1989 ACM/IEEE conference on Supercomputing, p.351-360, November 12-17, 1989, Reno, Nevada, United States

Mauricio G. C. Resende , Panos M. Pardalos , Yong Li, Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP, ACM Transactions on Mathematical Software (TOMS), v.22 n.1, p.104-118, March 1996

N. P. Chrisochoides , E. N. Houstis , C. E. Houstis, Geometry based mapping strategies for PDE computations, Proceedings of the 5th international conference on Supercomputing, p.115-127, June 17-21, 1991, Cologne, West Germany

Otto Wohlmuth , Friedrich Mayer-Lindenberg, A method for them embedding of arbitrary communication topologies into configurable parallel computers, Proceedings of the 1998 ACM symposium on Applied Computing, p.569-574, February 27-March 01, 1998, Atlanta, Georgia, United States

A. S. Ramkumar , S. G. Ponnambalam , N. Jawahar, A new iterated fast local search heuristic for solving QAP formulation in facility layout design, Robotics and Computer-Integrated Manufacturing, v.25 n.3, p.620-629, June, 2009