Geoscience Reference
In-Depth Information
Bos J (1993) Zoning in forest management: a quadratic assignment problem solved by simulated
annealing. J Environ Manag 37:127-145
Buffa ES, Armour GC, Vollmann TE (1962) Allocating facilities with CRAFT. Harv Bus Rev
42:136-158
Burer S, Vandenbussche D (2006) Solving lift-and-project relaxations of binary integer programs.
SIAM J Optimiz 16:726-750
Burkard R, Rendl F (1984) A thermodynamically motivated simulation procedure for combinato-
rial optimization problems. Eur J Oper Res 17:169-174
Burkard RE (1990) Locations with spatial interactions: the quadratic assignment problem. In:
Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley, New York, pp 387-437
Burkard RE, Cela E (1999) Linear assignment problems and extensions. In: Pardalos P, Du D-Z
(eds) Handbook of combinatorial optimization. Springer, Dordrecht, pp 75-149
Burkard RE (2013) Quadratic assignment problems. In: Pardalos P, Du D-Z (eds) Handbook of
combinatorial optimization, 2nd edn. Springer, New York, pp 2741-2814
Burkard RE, Offermann J (1977) Entwurf von schreibmaschinentastaturen mittels quadratischer
zuordnungsprobleme. Math Method Oper Res 21:121-132
Cantú-Paz E (2001) Migration policies, selection pressure, and parallel evolutionary algorithms. J
Heuristics 7:311-334
de Carvalho Jr SA, Rahmann S (2006) Microarray layout as a quadratic assignment problem.
In: Huson D, Kohlbacher O, Lupas A, Nieselt K, Zell A (eds) Proceedings of the German
conference on bioinformatics, vol 83. Gesellschaft für Informatik, Bonn, pp 11-20
Cela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer Academic
Publishers, Dordrecht
Connoly D (1990) An improved annealing scheme for the QAP. Eur J Oper Res 46:93-100
Cordeau JF, Gaudioso M, Laporte G, Moccia L (2006) A memetic heuristic for the generalized
quadratic assignment problem. INFORMS J Comput 18:433-443
Coxeter HSM (1973) Regular polytopes. Dover Publications, New York
Cung VD, Mautor T, Michelon P, Tavares AI (1997) A scatter search based approach for
the quadratic assignment problem. In: Proceedings of the IEEE international conference on
evolutionary computation and evolutionary programming (ICEC'97), Indianapolis, pp 165-170
Dickey JW, Hopkins JW (1972) Campus building arrangement using topaz. Transp Res 6:59-68
Drezner T, Drezner Z (2005) Genetic algorithms: mimicking evolution and natural selection in
optimization models. In: Bar-Cohen Y (ed) Biomimetics—biologically inspired technologies.
CRC Press, Boca Raton, pp 157-175
Drezner T, Drezner Z (2006) Gender specific genetic algorithms. INFOR Inform Syst Oper Res
44:117-127
Drezner Z (1975) Problems in non-linear programming (the allocation problem). Ph.D. thesis, The
Technion, Haifa
Drezner Z (1980) DISCON—a new method for the layout problem. Oper Res 28:1375-1384
Drezner Z (1987) A heuristic procedure for the layout of a large number of facilities. Manag Sci
33:907-915
Drezner Z (2002) A new heuristic for the quadratic assignment problem. J Appl Math Decis Sci
6:163-173
Drezner Z (2003) A new genetic algorithm for the quadratic assignment problem. INFORMS J
Comput 15:320-330
Drezner Z (2005a) A distance based rule for removing population members in genetic algorithms.
4OR-Q J Oper Res 3:109-116
Drezner Z (2005b) The extended concentric tabu for the quadratic assignment problem. Eur J Oper
Res 160:416-422
Drezner Z (2006) Finding a cluster of points and the grey pattern quadratic assignment problem.
OR Spectr 28:417-436
Drezner Z (2008a) Extensive experiments with hybrid genetic algorithms for the solution of the
quadratic assignment problem. Comput Oper Res 35:717-736
