K. Aardal, Capacitated facility location: Separation algorithms and computational experience, Mathematical Programming, vol.8, issue.2, pp.149-175, 1998.
DOI : 10.1007/BF01581103

URL : http://ecommons.cornell.edu/bitstream/1813/8984/1/TR001101.pdf

K. Aardal, Reformulation of capacitated facility location problems: How redundant information can help, Annals of Operations Research, vol.82, pp.289-308, 1998.
DOI : 10.1023/A:1018966804496

R. K. Ahuja, J. B. Orlin, S. Pallottino, M. P. Scaparra, and M. G. Scutellà, A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem, Management Science, vol.50, issue.6, pp.749-760, 2004.
DOI : 10.1287/mnsc.1030.0193

P. Avella, M. Boccia, A. Sforza, and I. Vasil-'ev, An effective heuristic for large-scale capacitated facility location problems, Journal of Heuristics, vol.50, issue.3, pp.597-615, 2009.
DOI : 10.1007/BFb0120697

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

F. Barahona and F. A. Chudak, Near-optimal solutions to large-scale facility location problems, Discrete Optimization, vol.2, issue.1, pp.35-50, 2005.
DOI : 10.1016/j.disopt.2003.03.001

J. Barceló and J. Casanovas, A heuristic lagrangean algorithm for the capacitated plant location problem, European Journal of Operational Research, vol.15, issue.2, pp.212-226, 1984.
DOI : 10.1016/0377-2217(84)90211-X

M. S. Bazaraa and H. D. Sherali, On the choice of step size in subgradient optimization, European Journal of Operational Research, vol.7, issue.4, pp.380-388, 1981.
DOI : 10.1016/0377-2217(81)90096-5

J. E. Beasley, An algorithm for solving large capacitated warehouse location problems, European Journal of Operational Research, vol.33, issue.3, pp.314-325, 1988.
DOI : 10.1016/0377-2217(88)90175-0

J. E. Beasley, Lagrangean heuristics for location problems, European Journal of Operational Research, vol.65, issue.3, pp.383-399, 1993.
DOI : 10.1016/0377-2217(93)90118-7

S. Belhaiza, P. Hansen, and G. Laporte, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Computers & Operations Research, vol.52, pp.269-281, 2014.
DOI : 10.1016/j.cor.2013.08.010

P. M. Camerini, L. Fratta, and F. Maffioli, On improving relaxation methods by modified gradient techniques, Mathematical Programming Study, vol.3, pp.26-34, 1975.
DOI : 10.1007/BFb0120697

E. Carrizosa, A. Ushakov, and I. Vasilyev, A computational study of a nonlinear minsum facility location problem, Computers & Operations Research, vol.39, issue.11, pp.2625-2633, 2012.
DOI : 10.1016/j.cor.2012.01.009

P. Chardaire, J. L. Lutton, and A. Sutter, Upper and lower bounds for two-level simple plant location problem, Annals of Operations Research, vol.86, pp.117-140, 1999.
DOI : 10.1023/A:1018942415824

C. H. Chen and C. J. Ting, Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem, Transportation Research Part E: Logistics and Transportation Review, vol.44, issue.6, pp.1099-1122, 2008.
DOI : 10.1016/j.tre.2007.09.001

G. Cornuejols, M. L. Fisher, and L. A. Wolsey, Exceptional Paper???Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms, Management Science, vol.23, issue.8, pp.789-810, 1977.
DOI : 10.1287/mnsc.23.8.789

G. Cornuejols, R. Sridharan, and J. M. Thizy, A comparison of heuristics and relaxations for the capacitated plant location problem, European Journal of Operational Research, vol.50, issue.3, pp.280-297, 1991.
DOI : 10.1016/0377-2217(91)90261-S

M. J. Cortinhal and M. E. Captivo, Upper and lower bounds for the single source capacitated location problem, European Journal of Operational Research, vol.151, issue.2, pp.333-351, 2003.
DOI : 10.1016/S0377-2217(02)00829-9

H. Delmaire, J. Díaz, E. Fernández, and M. Ortega, Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem, INFOR: Information Systems and Operational Research, vol.37, issue.3, pp.194-225, 1999.
DOI : 10.1080/03155986.1999.11732381

J. Díaz and E. Fernández, A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem, Journal of the Operational Research Society, vol.53, issue.7, pp.728-740, 2002.
DOI : 10.1057/palgrave.jors.2601353

W. Domschke and A. Drexl, ADD-heuristics' starting procedures for capacitated plant location models, European Journal of Operational Research, vol.21, issue.1, pp.47-53, 1985.
DOI : 10.1016/0377-2217(85)90086-4

L. Dupont, Branch and bound algorithm for a facility location problem with concave site dependent costs, International Journal of Production Economics, vol.112, issue.1, pp.245-254, 2008.
DOI : 10.1016/j.ijpe.2007.04.001

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

J. W. Escobar, R. Linfati, M. G. Baldoquin, and P. Toth, A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem, Transportation Research Part B: Methodological, vol.67, pp.344-356, 2014.
DOI : 10.1016/j.trb.2014.05.014

E. Feldman, F. A. Lehrer, and T. L. Ray, Warehouse Location Under Continuous Economies of Scale, Management Science, vol.12, issue.9, pp.670-684, 1966.
DOI : 10.1287/mnsc.12.9.670

M. L. Fisher, The Lagrangian Relaxation Method for Solving Integer Programming Problems, Management Science, vol.27, issue.1, pp.1-18, 1981.
DOI : 10.1287/mnsc.27.1.1

V. J. Filho and R. D. Galvão, A tabu search heuristic for the concentrator location problem, Location Science, vol.6, issue.1-4, pp.189-209, 1998.
DOI : 10.1016/S0966-8349(98)00046-1

P. M. França, N. M. Sosa, and V. Pureza, An adaptive tabu search algorithm for the capacitated clustering problem, International Transactions in Operational Research, vol.220, issue.3, pp.665-678, 1999.
DOI : 10.1111/1475-3995.d01-43

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.1287/mnsc.9.4.643

L. L. Gao and E. P. Robinson, A dual-based optimization procedure for the two-echelon uncapacitated facility location problem, Naval Research Logistics, vol.28, issue.2, pp.191-212, 1992.
DOI : 10.1016/S0167-5060(08)70728-3

M. Gen, Y. Tsujimura, and S. Ishizaki, Optimal design of a star-LAN using neural networks, Computers & Industrial Engineering, vol.31, issue.3-4, pp.855-859, 1996.
DOI : 10.1016/S0360-8352(96)00279-3

A. M. Geoffrion, Lagrangian Relaxation for Integer Programming, Mathematical Programming Study, vol.2, pp.82-114, 1974.
DOI : 10.1007/978-3-540-68279-0_9

A. M. Geoffrion and G. W. Graves, Multicommodity Distribution System Design by Benders Decomposition, Management Science, vol.20, issue.5, pp.822-844, 1974.
DOI : 10.1287/mnsc.20.5.822

A. M. Geoffrion and R. Mcbride, Lagrangean Relaxation Applied to Capacitated Facility Location Problems, A I I E Transactions, vol.19, issue.4, pp.40-47, 1978.
DOI : 10.1287/opre.19.4.1070

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, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, 1986.
DOI : 10.1016/0305-0548(86)90048-1

F. Glover, Tabu Search???Part I, ORSA Journal on Computing, vol.1, issue.3, pp.190-206, 1989.
DOI : 10.1287/ijoc.1.3.190

F. Glover, Tabu Search???Part II, ORSA Journal on Computing, vol.2, issue.1, pp.4-32, 1990.
DOI : 10.1287/ijoc.2.1.4

S. Grolimund and J. G. Ganascia, Driving Tabu Search with case-based reasoning, European Journal of Operational Research, vol.103, issue.2, pp.326-338, 1997.
DOI : 10.1016/S0377-2217(97)00123-9

URL : https://hal.archives-ouvertes.fr/hal-01184804

P. Hansen and N. Mladenovi?, Variable neighborhood search: Principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-467, 2001.
DOI : 10.1016/S0377-2217(00)00100-4

J. Harkness and C. Revelle, Facility location with increasing production costs, European Journal of Operational Research, vol.145, issue.1, pp.1-13, 2003.
DOI : 10.1016/S0377-2217(02)00176-5

I. Harris, C. L. Mumford, and M. M. Naim, A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling, Transportation Research Part E: Logistics and Transportation Review, vol.66, pp.1-22, 2014.
DOI : 10.1016/j.tre.2014.01.010

M. Held, P. Wolfe, and H. P. Crowder, Validation of subgradient optimization, Mathematical Programming, vol.8, issue.1, pp.62-88, 1974.
DOI : 10.1515/9781400873173

K. S. Hindi and T. Basta, Computationally efficient solution of a multiproduct, two-stage distributionlocation problem, The Journal of the Operational Research Society, vol.45, pp.1316-1323, 1994.

K. Hindi and K. Pienkosz, Efficient solution of large scale, single-source, capacitated plant location problems, Journal of the Operational Research Society, vol.50, issue.3, pp.268-274, 1999.
DOI : 10.1057/palgrave.jors.2600698

Y. Hinojosa, J. Puerto, and F. R. Fernandez, A multiperiod two-echelon multicommodity capacitated plant location problem, European Journal of Operational Research, vol.123, issue.2, pp.271-291, 2000.
DOI : 10.1016/S0377-2217(99)00256-8

K. Holmberg and J. Ling, A Lagrangean heuristic for the facility location problem with staircase costs, European Journal of Operational Research, vol.97, issue.1, pp.63-74, 1997.
DOI : 10.1016/S0377-2217(96)00058-6

K. Holmberg, M. Rönnqvist, and D. Yuan, An exact algorithm for the capacitated facility location problems with single sourcing, European Journal of Operational Research, vol.113, issue.3, pp.544-559, 1999.
DOI : 10.1016/S0377-2217(98)00008-3

S. K. Jacobsen, Heuristics for the capacitated plant location model, European Journal of Operational Research, vol.12, issue.3, pp.253-261, 1983.
DOI : 10.1016/0377-2217(83)90195-9

S. C. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

URL : http://www.cs.virginia.edu/cs432/documents/sa-1983.pdf

J. G. Klincewicz and H. Luss, A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints, Journal of the Operational Research Society, vol.37, issue.5, pp.495-500, 1986.
DOI : 10.1057/jors.1986.84

A. Klose, An LP-based heuristic for two-stage capacitated facility location problems, Journal of the Operational Research Society, vol.50, issue.2, pp.157-166, 1999.
DOI : 10.1057/palgrave.jors.2600675

A. Klose, A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem, European Journal of Operational Research, vol.126, issue.2, pp.408-421, 2000.
DOI : 10.1016/S0377-2217(99)00300-8

A. Klose and A. Drexl, Facility location models for distribution system design, European Journal of Operational Research, vol.162, issue.1, pp.24-29, 2005.
DOI : 10.1016/j.ejor.2003.10.031

A. Klose and S. Görtz, A branch-and-price algorithm for the capacitated facility location problem, European Journal of Operational Research, vol.179, issue.3, pp.1109-1125, 2007.
DOI : 10.1016/j.ejor.2005.03.078

M. Körkel, On the exact solution of large-scale simple plant location problems, European Journal of Operational Research, vol.39, issue.2, pp.157-73, 1989.
DOI : 10.1016/0377-2217(89)90189-6

J. Krarup and P. M. Pruzan, The simple plant location problem: Survey and synthesis, European Journal of Operational Research, vol.12, issue.1, pp.36-81, 1983.
DOI : 10.1016/0377-2217(83)90181-9

?. Küçüko?lu and N. Öztürk, An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows, Computers & Industrial Engineering, vol.86, pp.60-68, 2015.
DOI : 10.1016/j.cie.2014.10.014

A. A. Kuehn and M. J. Hamburger, A Heuristic Program for Locating Warehouses, Management Science, vol.9, issue.4, pp.643-66, 1963.
DOI : 10.1287/mnsc.9.4.643

C. Y. Lee, A cross decomposition algorithm for a multiproduct-multitype facility location problem, Computers & Operations Research, vol.20, issue.5, pp.527-540, 1993.
DOI : 10.1016/0305-0548(93)90016-C

J. M. Leung and T. L. Magnanti, Valid inequalities and facets of the capacitated plant location problem, Mathematical Programming, vol.14, issue.1-3, pp.271-300, 1989.
DOI : 10.1007/BFb0120888

A. Marín and B. Pelegrín, Applying Lagrangian relaxation to the resolution of two-stage location problems, Annals of Operations Research, vol.86, pp.179-198, 1999.
DOI : 10.1023/A:1018998500803

J. B. Mazzola and A. W. Neebe, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, European Journal of Operational Research, vol.115, issue.2, pp.285-299, 1999.
DOI : 10.1016/S0377-2217(98)00303-8

M. T. Melo, S. Nickel, and F. Saldanha-da-gama, Facility location and supply chain management ??? A review, European Journal of Operational Research, vol.196, issue.2, pp.401-412, 2009.
DOI : 10.1016/j.ejor.2008.05.007

N. Mladenovi? and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, pp.1097-1100, 1997.
DOI : 10.1016/S0305-0548(97)00031-2

G. L. Nemhauser, L. A. Wolsey, and L. M. Fisher, An analysis of approximations for maximizing submodular set functions???I, Mathematical Programming, vol.16, issue.1, pp.265-94, 1978.
DOI : 10.1007/BF01588971

L. K. Nozick, The fixed charge facility location problem with coverage restrictions, Transportation Research Part E: Logistics and Transportation Review, vol.37, issue.4, pp.281-296, 2001.
DOI : 10.1016/S1366-5545(00)00018-1

I. H. Osman and N. Christofides, Capacitated clustering problems by hybrid simulated annealing and tabu search, International Transactions in Operational Research, vol.1, issue.3, pp.317-336, 1994.
DOI : 10.1016/0969-6016(94)90032-9

H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Computers & Operations Research, vol.14, issue.3, pp.197-208, 1987.
DOI : 10.1016/0305-0548(87)90022-0

H. Pirkul and V. Jayaraman, A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution, Computers & Operations Research, vol.25, issue.10, pp.869-878, 1998.
DOI : 10.1016/S0305-0548(97)00096-8

D. Pisinger, An expanding-core algorithm for the exact 0???1 knapsack problem, European Journal of Operational Research, vol.87, issue.1, pp.175-87, 1995.
DOI : 10.1016/0377-2217(94)00013-3

C. S. Revelle, H. A. Eiselt, and M. S. Daskin, A bibliography for some fundamental problem categories in discrete location science, European Journal of Operational Research, vol.184, issue.3, pp.817-848, 2008.
DOI : 10.1016/j.ejor.2006.12.044

H. Ro and D. Tcha, A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints, European Journal of Operational Research, vol.18, issue.3, pp.349-358, 1984.
DOI : 10.1016/0377-2217(84)90156-5

M. Rönnqvist, S. Tragantalerngsak, and J. Holt, A repeated matching heuristic for the single-source References 109, 1999.

R. M. Soland, Optimal Facility Location with Concave Costs, Operations Research, vol.22, issue.2, pp.373-382, 1974.
DOI : 10.1287/opre.22.2.373

R. Sridharan, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, European Journal of Operational Research, vol.66, issue.3, pp.305-312, 1993.
DOI : 10.1016/0377-2217(93)90219-D

M. H. Sun, A tabu search heuristic procedure for the capacitated facility location problem, Journal of Heuristics, vol.41, issue.2, pp.91-118, 2012.
DOI : 10.1007/BF02022565

R. Swarnkar and M. K. Tiwari, Modeling machine loading problem of FMSs and its solution methodology using a hybrid tabu search and simulated annealing-based heuristic approach, Robotics and Computer-Integrated Manufacturing, vol.20, issue.3, pp.199-209, 2004.
DOI : 10.1016/j.rcim.2003.09.001

E. Taniguchi, M. Noritake, T. Yamada, and T. Izumitani, Optimal size and location planning of public logistics terminals Transportation Research Part, pp.207-222, 1999.

S. Tragantalerngsak, J. Holt, and M. Rönnqvist, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, European Journal of Operational Research, vol.102, issue.3, pp.611-625, 1997.
DOI : 10.1016/S0377-2217(96)00227-5

S. Tragantalerngsak, J. Holt, and M. Rönnqvist, An exact method for the two-echelon, single-source, capacitated facility location problem, European Journal of Operational Research, vol.123, issue.3, pp.473-489, 2000.
DOI : 10.1016/S0377-2217(99)00105-8

D. Tuzun and L. I. Burke, A two-phase tabu search approach to the location routing problem, European Journal of Operational Research, vol.116, issue.1, pp.87-99, 1999.
DOI : 10.1016/S0377-2217(98)00107-6

S. Vaithyanathan, L. I. Burke, and M. A. Magent, Massively parallel analog tabu search using neural networks applied to simple plant location problems, European Journal of Operational Research, vol.93, issue.2, pp.317-330, 1996.
DOI : 10.1016/0377-2217(96)00047-1

T. J. Van-roy, A Cross Decomposition Algorithm for Capacitated Facility Location, Operations Research, vol.34, issue.1, pp.145-163, 1986.
DOI : 10.1287/opre.34.1.145

P. Wentges, Accelerating Benders' decomposition for the capacitated facility location problem, Mathematical Methods of Operations Research, vol.34, issue.1, pp.267-90, 1996.
DOI : 10.1007/BF01194335

L. Y. Wu, X. S. Zhang, and J. L. Zhang, Capacitated facility location problem with general setup cost, Computers & Operations Research, vol.33, issue.5, pp.1226-1241, 2006.
DOI : 10.1016/j.cor.2004.09.012

Z. Yang, F. Chu, and H. X. Chen, A cut-and-solve based algorithm for the single-source capacitated facility location problem, European Journal of Operational Research, vol.221, issue.3, pp.521-532, 2012.
DOI : 10.1016/j.ejor.2012.03.047

URL : https://hal.archives-ouvertes.fr/hal-00735248