References
- Koopmans TC, Beckmann MJ. Assignment problems and the location of economic activities. Econometrica. 1957;25:53–76.10.2307/1907742
- Sahni S, Gonzalez T. P-complete approximation problems. J ACM. 1976;23:555–565.10.1145/321958.321975
- Burkard RE, Cela E, Pardalos PM, et al. The quadratic assignment problem. In: Du D-Z, Pardalos PM, editors. Handbook of combinatorial optimization. Boston (MA): Kluwer Academic Publishers; 1998. p. 241–338.
- Loiola EM, de Abreu NMM, Boaventura-Netto PO, et al. A survey for the quadratic assignment problem. Eur Oper Res. 2007;176:657–690.10.1016/j.ejor.2005.09.032
- Lee C-G, Ma Z. The generalized quadratic assignment problem. Technical Report. Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, ON; 2004.
- Cordeau J-F, Gaudioso M, Laporte G, et al. A memetic heuristic for the generalized assignment problem. INFORMS J Comput. 2006;18:433–443.10.1287/ijoc.1040.0128
- Cordeau J-F, Gaudioso M, Laporte G, et al. The service allocation problem at the Gioia Tauro maritime terminal. Eur Oper Res. 2007;176:1167–1184.10.1016/j.ejor.2005.09.004
- Unal YZ, Uysal O. A new mixed integer programming model for curriculum balancing: application to a Turkish university. Eur J Oper Res. 2014;238:339–347.10.1016/j.ejor.2014.03.015
- Mckendall AR, Noble JS, Klein CM. Facility layout of irregular-shaped departments using a nested approach. Int J Prod Res. 1999;37:2895–2914.10.1080/002075499190338
- Hahn PM, Kim B-J, Guignard M. An algorithm for the generalized quadratic assignment problem. Comput Optim Appl. 2008;40:351–372.10.1007/s10589-007-9093-1
- Pessoa AA, Hahn PM, Guignard M, et al. Algorithms for the generalized quadratic assignment problem combining lagrangean decomposition and the reformulation-linearization technique. Eur J Oper Res. 2010;206:54–63.10.1016/j.ejor.2010.02.006
- Holland JH. Adaptation in natural and artificial systems. Ann Arbor (MI): University of Michigan Press; 1975.
- Glover F. Future paths for integer programming and links to artificial intelligence. Comput Oper Res. 1986;13:533–549.10.1016/0305-0548(86)90048-1
- Mateus GR, Resende MGC, Silva RMA. GRASP with path-relinking for the generalized quadratic assignment problem. J Heuristics. 2011;17:527–565.10.1007/s10732-010-9144-0
- McKendall AR, Jaramillo JR. A tabu search heuristic for the dynamic space allocation problem. Comput Oper Res. 2006;32:107–125.
- McKendall AR, Hakobyan A. Heuristics for the dynamic facility layout problem with unequal-area departments. Eur J Oper Res. 2010;201:171–182.10.1016/j.ejor.2009.02.028
- McKendall AR, Liu W-H. New tabu search heuristics for the dynamic facility layout problem. Int J Prod Res. 2012;50:867–878.10.1080/00207543.2010.545446
- Liang Y-C, Kulturel-Konak S, Lo M-H. A multiple-level variable neighborhood search approach to the orienteering problem. J Ind Prod Eng. 2013;30:238–247.10.1080/21681015.2013.818069
- Yousefikhoshbakht M, Didehvar F, Rahmati F. A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery. J Ind Prod Eng. 2014;31:65–75.10.1080/21681015.2014.893928
- Wang S-Y, Chuang Y-T, Lin BMT. Minimizing talent cost and operating cost in film production. J Ind Prod Eng. 2016;33:17–31.
- Glover F. Tabu search Part I. ORSA J Comput. 1989;1:1900–2006.
- Glover F. Tabu search part II. ORSA J Comput. 1990;2:4–32.10.1287/ijoc.2.1.4
- Glover F. Tabu search: a tutorial. Interfaces. 1990;20:74–94.10.1287/inte.20.4.74