P. Ramanan, J. S. Deogun, and C. L. Liu, A personnel assignment problem, Journal of Algorithms, vol.5, issue.1, pp.132-144, 1984.
DOI : 10.1016/0196-6774(84)90043-9

M. L. Fisher, R. Jaikumar, and L. N. Wassenhove, A Multiplier Adjustment Method for the Generalized Assignment Problem, Management Science, vol.32, issue.9, pp.1095-1103, 1986.
DOI : 10.1287/mnsc.32.9.1095

D. G. Cattrysse and L. N. Van-wassenhove, A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, vol.60, issue.3, pp.260-272, 1992.
DOI : 10.1016/0377-2217(92)90077-M

. A. D?-az,, A Tabu search heuristic for the generalized assignment problem, European Journal of Operational Research, vol.132, issue.1, pp.22-38, 2001.
DOI : 10.1016/S0377-2217(00)00108-9

H. E. Romeijn and D. R. Morales, A class of greedy algorithms for the generalized assignment problem, Discrete Applied Mathematics, vol.103, issue.1-3, pp.1-3, 2000.
DOI : 10.1016/S0166-218X(99)00224-3

P. C. Chu and J. E. Beasley, A genetic algorithm for the generalised assignment problem, Computers & Operations Research, vol.24, issue.1, pp.17-23, 1997.
DOI : 10.1016/S0305-0548(96)00032-9

L. Öz-akir, A. Baykaso?lu, and A. P. Tapkan, Bees algorithm for generalized assignment problem, Applied Mathematics and Computation, issue.11, pp.215-3782, 2010.

A. J. Woodcock and J. M. Wilson, A hybrid tabu search/branch & bound approach to solving the generalized assignment problem, European Journal of Operational Research, vol.207, issue.2, pp.566-578, 2010.
DOI : 10.1016/j.ejor.2010.05.007

D. W. Pentico, Assignment problems: A golden anniversary survey, European Journal of Operational Research, vol.176, issue.2, pp.774-793, 2007.
DOI : 10.1016/j.ejor.2005.09.014

S. Geetha and M. N. Vartak, The three-dimensional bottleneck assignment problem with capacity constraints, European Journal of Operational Research, vol.73, issue.3, pp.562-568, 1994.
DOI : 10.1016/0377-2217(94)90253-4

K. C. Gilbert and R. B. , Hofstra, multidimensional assignment problems. Decision Sciences, pp.306-321, 1988.

M. Hifi, M. Michrafy, and A. Sbihi, Heuristic algorithms for the multiplechoice multidimensional knapsack problem, Journal of the Operational Research Society, issue.12, pp.55-1323, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00125572

M. Tavana, K. Khalili-damghani, and A. Abtahi, A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm, Annals of Operations Research, vol.24, issue.4, pp.449-483, 2013.
DOI : 10.1007/s10479-013-1387-3

T. T. Bäck, . Bäck, D. B. Fogel, Z. Michalewicz, J. Hesser et al., Introduction to evolutionary algorithms, Chapter 7 Institute of Physics Publishing. 16, Evolutionary Computation Lecture Notes in Computer Science, vol.1, issue.496, pp.23-32, 1991.

K. Deb, An efficient constraint handling method for genetic algorithms, Computer Methods in Applied Mechanics and Engineering, vol.186, issue.2-4, pp.311-338, 2000.
DOI : 10.1016/S0045-7825(99)00389-8