A. Atamtürk and M. W. Savelsbergh, Integer-Programming Software Systems, Annals of Operations Research, vol.35, issue.5, pp.67-124, 2005.
DOI : 10.1007/s10479-005-3968-2

P. Avella and M. , A computational study of exact knapsack separation for the generalized assignment problem, Computational Optimization and Applications, vol.10, issue.6, pp.543-555, 2010.
DOI : 10.1007/s10589-008-9183-8

F. Barahona and R. Anbil, The volume algorithm: producing primal solutions with a subgradient method, Mathematical Programming, pp.385-399, 2000.
DOI : 10.1007/s101070050002

E. M. Beale and J. A. Tomlin, Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, Mathematical Methods of Optimization, vol.69, pp.447-454, 1970.

J. E. Beasley, Generalised assignment problem test data sets, 2011.

C. Beltran, C. Tadonki, and J. P. Vial, Solving the p-Median Problem with a Semi-Lagrangian Relaxation, Computational Optimization and Applications, vol.25, issue.3, pp.239-260, 2006.
DOI : 10.1007/s10589-006-6513-6

C. Beltran-royo, J. P. Vial, and A. Alonso-ayuso, Semi-Lagrangian relaxation applied to??the??uncapacitated facility location problem, Computational Optimization and Applications, vol.33, issue.1, pp.1-23, 2010.
DOI : 10.1007/s10589-010-9338-2

O. Bilde and J. Krarup, Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem, Annals of Discrete Mathematics, vol.1, pp.79-97, 1977.
DOI : 10.1016/S0167-5060(08)70728-3

B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

S. Boussier, M. Vasquez, Y. Vimont, S. Hanafi, and P. Michelon, A multi-level search strategy for the 0???1 Multidimensional Knapsack Problem, Discrete Applied Mathematics, vol.158, issue.2, pp.97-109, 2010.
DOI : 10.1016/j.dam.2009.08.007

T. Cura, A parallel local search approach to solving the uncapacitated warehouse location problem, Computers & Industrial Engineering, vol.59, issue.4, pp.1000-1009, 2010.
DOI : 10.1016/j.cie.2010.09.012

S. Demassey, C. Artigues, and P. Michelon, An application of resolution search to the rcpsp, 17th European Conference on Combinatorial Optimization ECCO, 2004.

J. A. Diaz and E. Fernandez, 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

D. Erlenkotter, A Dual-Based Procedure for Uncapacitated Facility Location, Operations Research, vol.26, issue.6, pp.992-1009, 1978.
DOI : 10.1287/opre.26.6.992

A. D. Flaxman, A. M. Frieze, and J. C. Vera, On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem, Combinatorics, Probability and Computing, vol.12, issue.05, pp.713-732, 2007.
DOI : 10.1016/0377-2217(83)90181-9

A. Frangioni, Solving semidefinite quadratic problems within nonsmooth optimization algorithms, Computers & Operations Research, vol.23, issue.11, pp.1099-1118, 1996.
DOI : 10.1016/0305-0548(96)00006-8

R. D. Galvão and L. A. Raggi, A method for solving to optimality uncapacitated location problems, Annals of Operations Research, vol.21, issue.1, pp.225-244, 1989.
DOI : 10.1007/BF02097805

D. Ghosh, Neighborhood search heuristics for the uncapacitated facility location problem, European Journal of Operational Research, vol.150, issue.1, pp.150-162, 2003.
DOI : 10.1016/S0377-2217(02)00504-0

F. Glover, A template for scatter search and path relinking, Dans Artificial evolution, pp.1-51, 1998.
DOI : 10.1007/BFb0026589

B. Goldengorin, D. Ghosh, and G. Sierksma, Branch and peg algorithms for the simple plant location problem, 2003.

B. Goldengorin, G. A. Tijssen, D. Ghosh, and G. Sierksma, Solving the simple plant location problem using a data correcting approach, Journal of Global Optimization, vol.25, issue.4, pp.377-406, 2003.
DOI : 10.1023/A:1022503826877

A. R. Guner and M. Sevkli, A Discrete Particle Swarm Optimization Algorithm for Uncapacitated Facility Location Problem, Journal of Artificial Evolution and Applications, vol.34, issue.10, pp.1-9, 2008.
DOI : 10.1016/j.cor.2006.12.030

S. Haddadi and H. Ouzia, Effective algorithm and heuristic for the generalized assignment problem, European Journal of Operational Research, vol.153, issue.1, pp.184-190, 2004.
DOI : 10.1016/S0377-2217(02)00710-5
URL : https://hal.archives-ouvertes.fr/hal-01170427

S. Hanafi and F. Glover, Resolution search and dynamic branch-and-bound, Journal of Combinatorial Optimization, vol.6, issue.4, pp.401-423, 2002.
DOI : 10.1023/A:1019573820792

P. Hansen, J. Brimberg, D. Uro?evi?, and N. Mladenovi?, Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem, INFORMS Journal on Computing, vol.19, issue.4, p.552, 2007.
DOI : 10.1287/ijoc.1060.0196

W. Healy, Mutiple choice programming, Operations Research, p.12, 1964.

J. B. Hiriart-urruty and C. Lemaréchal, Convex analysis and minimization algorithms : Fundamentals, 1996.
DOI : 10.1007/978-3-662-02796-7

J. Homberger and H. Gehring, A Two-Level Parallel Genetic Algorithm for the Uncapacitated Warehouse  Location Problem, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008), p.67, 2008.
DOI : 10.1109/HICSS.2008.42

B. Julstrom, A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp.295-307, 2008.

N. Karabakal, J. C. Bean, and J. R. Lohmann, A steepest descent multiplier adjustment method for the generalized assignment problem, 1992.

J. Kratica, D. To?ic, V. Filipovi?, and I. Ljubi?, Solving the simple plant location problem by genetic algorithm, RAIRO - Operations Research, vol.35, issue.1, pp.127-142, 2001.
DOI : 10.1051/ro:2001107

A. N. Letchford and S. J. Miller, Fast bounding procedures for large instances of the Simple Plant Location Problem, Computers & Operations Research, vol.39, issue.5, 2011.
DOI : 10.1016/j.cor.2011.06.014

L. Michel and P. Van-hentenryck, A simple tabu search for warehouse location, European Journal of Operational Research, vol.157, issue.3, pp.576-591, 2004.
DOI : 10.1016/S0377-2217(03)00247-9

N. Mladenovi?, J. Brimberg, and P. Hansen, A note on duality gap in the simple plant location problem, European Journal of Operational Research, vol.174, issue.1, pp.11-22, 2006.
DOI : 10.1016/j.ejor.2004.12.022

?. Muter, S. I. Birbil, and G. Sahin, Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems, INFORMS Journal on Computing, vol.22, issue.4, pp.603-619, 2010.
DOI : 10.1287/ijoc.1090.0376

R. M. Nauss, Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach, INFORMS Journal on Computing, vol.15, issue.3, pp.249-266, 2003.
DOI : 10.1287/ijoc.15.3.249.16075

Y. Nesterov, Smooth minimization of non-smooth functions, Mathematical Programming, pp.127-152, 2005.
DOI : 10.1007/s10107-004-0552-5

M. Palpant, C. Artigues, and C. Oliva, Mars : a hybrid scheme based on resolution search and constraint programming for constraint satisfaction problems, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00142844

A. Pigatti, M. P. De-aragao, and E. Uchoa, Stabilized branch-and-cut-and-price for the generalized assignment problem, Electronic Notes in Discrete Mathematics, vol.19, pp.389-395, 2005.
DOI : 10.1016/j.endm.2005.05.052

D. Pisinger, A Minimal Algorithm for the 0-1 Knapsack Problem, Operations Research, vol.45, issue.5, pp.758-767, 1997.
DOI : 10.1287/opre.45.5.758

M. Posta, J. A. Ferland, and P. Michelon, An exact method with variable fixing for solving the generalized assignment problem, Computational Optimization and Applications, vol.169, issue.2, 2011.
DOI : 10.1007/s10589-011-9432-0
URL : https://hal.archives-ouvertes.fr/hal-01320026

M. Posta, J. A. Ferland, and P. Michelon, Generalized resolution search, Discrete Optimization, vol.8, issue.2, pp.215-228, 2011.
DOI : 10.1016/j.disopt.2010.08.004
URL : https://hal.archives-ouvertes.fr/hal-01320028

M. G. Resende and R. F. Werneck, A hybrid multistart heuristic for the uncapacitated facility location problem, European Journal of Operational Research, vol.174, issue.1, pp.54-68, 2006.
DOI : 10.1016/j.ejor.2005.02.046

G. T. Ross and R. M. Soland, A branch and bound algorithm for the generalized assignment problem, Mathematical Programming, vol.21, issue.1, pp.91-103, 1975.
DOI : 10.1007/BF01580430

M. Savelsbergh, A Branch-and-Price Algorithm for the Generalized Assignment Problem, Operations Research, vol.45, issue.6, pp.831-841, 1997.
DOI : 10.1287/opre.45.6.831

M. Sun, Solving the uncapacitated facility location problem using tabu search. Computers and operations research, pp.2563-2589, 2006.

L. A. Wolsey, Integer programming, 1998.

M. Yagiura, T. Ibaraki, and F. Glover, An Ejection Chain Approach for the Generalized Assignment Problem, INFORMS Journal on Computing, vol.16, issue.2, pp.133-151, 2004.
DOI : 10.1287/ijoc.1030.0036

M. Yagiura, T. Ibaraki, and F. Glover, A path relinking approach with ejection chains for the generalized assignment problem, European Journal of Operational Research, vol.169, issue.2, pp.548-569, 2006.
DOI : 10.1016/j.ejor.2004.08.015