Geoscience Reference
In-Depth Information
Nyberg A, Westerlund T (2012) A new exact discrete linear reformulation of the quadratic
assignment problem. Eur J Oper Res 220:314-319
Nyström M (1999) Solving certain large instances of the quadratic assignment problem:
Steinberg's examples. Technical report, California Institute of Technology.
http://resolver.
Okabe A, Suzuki A (1987) Stability of spatial competition for a large number of firms on a bounded
two-dimensional space. Environ Plann A 16:107-114
Oliveira CAS, Pardalos PM, Resende MGC (2004) GRASP with path-relinking for the quadratic
assignment problem. In: Ribeiro CC, Martins SL (eds) Efficient and experimental algorithms.
Springer, Berlin/Heidelberg, pp 237-261
Pierce JF, Crowston WB (1971) Tree-search algorithms for quadratic assignment problems. Nav
Res Logist Q 18:1-36
Pierskalla WP (1967) The tri-substitution method for the three-dimensional assignment problem.
CORS J 5:71-81
Pierskalla WP (1968) The multidimensional assignment problem. Oper Res 16:422-431
Ramakrishnan KG, Resende M, Ramachandran B, Pekny J (2002) Tight QAP bounds via linear
programming. In: Pardalos PM, Migdalas A, Burkard R (eds) Combinatorial and global
optimization. World Scientific Publishing, Singapore, pp 297-303
Rendl F (2002) The quadratic assignment problem. In: Drezner Z, Hamacher H (eds) Facility
location: applications and theory. Springer, Berlin
Rendl F, Sotirov R (2007) Bounds for the quadratic assignment problem using the bundle method.
Math Program 109:505-524
Resende M, Ramakrishnan K, Drezner Z (1995) Computational experiments with the lower bound
for the quadratic assignment problem based on linear programming. Oper Res 43:781-791
Roupin F (2004) From linear to semidefinite programming: an algorithm to obtain semidefinite
relaxations for bivalent quadratic problems. J Comb Optim 8:469-493
Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23:555-565
Schaffer JD, Caruana RA, Eshelman LJ (1989) A study of control parameters affecting online
performance of genetic algorithms. In: Schaffer JD (ed) Proceedings of the 3rd international
conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 51-60
Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull
representations for zero-one programming problems. SIAM J Discret Math 3:411-430
Sherali HD, Adams WP (1998) A reformulation-linearization technique for solving discrete and
continuous nonconvex problems. Springer, Berlin
Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput
2:33-45
Steinberg L (1961) The backboard wiring problem: a placement algorithm. SIAM Rev 3:37-50
Suzuki A, Drezner Z (1996) The p-center location problem in an area. Locat Sci 4:69-82
Suzuki A, Okabe A (1995) Using Voronoi diagrams. In: Drezner Z (ed) Facility location: a survey
of applications and methods. Springer, New York, pp 103-118
Szabo PG, Markot M, Csendes T, Specht E (2007) New approaches to circle packing in a square:
with program codes. Springer, New York
Taillard ÉD (1991) Robust tabu search for the quadratic assignment problem. Parallel Comput
17:443-455
Taillard ÉD (1995) Comparison of iterative searches for the quadratic assignment problem. Locat
Sci 3:87-105
Taillard ÉD (1998) Fant: fast ant system. Technical report, Istituto Dalle Molle Di Studi Sull
Intelligenza Artificiale, iDSIA Technical Report IDSIA-46-98
Taillard ÉD (2000) An introduction to ant systems. In: Laguna M, González-Velarde J (eds)
Computing tools for modeling, optimization and simulation. Wiley, New York, pp 131-144
Talbi EG, Roux O, Fonlupt C, Robillard D (2001) Parallel ant colonies for the quadratic assignment
problem. Futur Gener Comput Syst 17:441-449
Tate D, Smith A (1995) A genetic approach to the quadratic assignment problem. Comput Oper
Res 22:73-83
