Geoscience Reference
In-Depth Information
Drezner Z (2008b) Tabu search and hybrid genetic algorithms for quadratic assignment problems.
In: Jaziri W (ed) Tabu search, in-tech, pp 89-108. Available free on: http://books.i-techonline.
com
Drezner Z (2010) On the unboundedness of facility layout problems. Math Method Oper Res
72:205-216
Drezner Z, Marcoulides GA (2003) A distance-based selection of parents in genetic algorithms.
In: Resende MGC, de Sousa JP (eds) Metaheuristics: computer decision-making. Kluwer
Academic Publishers, Boston, pp 257-278
Drezner Z, Misevicius A (2013) Enhancing the performance of hybrid genetic algorithms by
differential improvement. Comput Oper Res 40:1038-1046
Drezner Z, Suzuki A (2010) Covering continuous demand in the plane. J Oper Res Soc 61:878-881
Drezner Z, Zemel E (1992) Competitive location in the plane. Ann Oper Res 40:173-193
Drezner Z, Hahn PM, Taillard ÉD (2005) Recent advances for the quadratic assignment problem
with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res
139:65-94
Drezner Z, Misevicius A, Palubeckis G (2014) Exact algorithms for the solution of the grey pattern
quadratic assignment problem. In review
Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach
and its performance on quadratic assignment problem. Inform Sci 217:65-77
Elshafei AN (1977) Hospital layout as a quadratic assignment problem. Oper Res Q 28:167-179
Fischetti M, Monaci M, Salvagnin D (2012) Three ideas for the quadratic assignment problem.
Oper Res 60:954-964
Fleurent C, Ferland J (1994) Genetic hybrids for the quadratic assignment problem. In: Pardalos P,
Wolkowicz H (eds) Quadratic assignment and related problems, DIMACS series in discrete
mathematics and theoretical computer science, vol 16. American Methematical Society,
Providence, pp 173-187
Fox BR, McMahon MB (1991) Genetic operators for sequencing problems. In: Rawlins G (ed)
Foundations of genetic algorithms. Morgan-Kaufmann, San Mateo, pp 284-300
Francis RL, McGinnis LF Jr, White JA (1992) Facility layout and location: an analytical approach,
2nd edn. Prentice Hall, Englewood Cliffs
Gambardella L, Taillard ÉD, Dorigo M (1999) Ant colonies for the quadratic assignment problem.
J Oper Res Soc 50:167-176
Geoffrion AM, Graves GW (1976) Scheduling parallel production lines with changeover costs:
practical application of a quadratic assignment/lp approa ch. Oper Res 24:595-610
Gilmore P (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. J
SIAM 10:305-313
Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156-
166
Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput
Oper Res 13:533-549
Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston
Hahn P, Grant T (1998) Lower bounds for the quadratic assignment problem based upon a dual
formulation. Oper Res 46:912-922
Hahn P, Krarup J (2001) A hospital facility problem finally solved. J Intell Manuf 12:487-496
Hahn PM, Kim BJ, Guignard M, Smith JM, Zhu YR (2008) An algorithm for the generalized
quadratic assignment problem. Comput Optim Appl 40:351-372
Hahn PM, Zhu YR, Guignard M, Hightower WL, Saltzman MJ (2012) A level-3 reformulation-
linearization technique-based bound for the quadratic assignment problem. INFORMS J
Comput 24:202-209
Heffley DR (1977) Assigning runners to a relay team. In: Ladany SP, Machol RE (eds) Optimal
strategies in sports. North-Holland, Amsterdam, pp 169-171
Hilbert
D,
Cohn-Vossen
S
(1956)
Geometry
and
the
imagination
(english
translation
of
Anschauliche Geometrie, 1932). Chelsea Publishing Company, New York
 
Search WWH ::




Custom Search