R. Andrade, A. P. Lucena, and N. Maculan, Using lagragian dual information to generate degree constrained spanning trees, Discrete Applied Mathematics, vol.154, issue.5, pp.703-717, 2006.

P. Avella, A. Sassano, and I. Vasil'ev, Computational study of largescale p-median problems, Mathematical Programming: Series A and B, vol.109, issue.1, pp.89-114, 2007.

J. E. Beasley, OR-Library: Distributing test problems by electronic mail, Journal of the Operational Research Society, vol.41, pp.1069-1072, 1990.

J. E. Beasley, Lagrangean relaxation, Modern Heuristic Techniques for Combinatorial Problems, pp.243-303, 1993.

J. E. Beasley, Lagrangean heuristics for location problems, European Journal of Operational Research, vol.65, issue.3, pp.383-399, 1993.

A. Belloni and A. Lucena, A lagrangian heuristic for the linear ordering problem, Metaheuristics: Computer Decision-Making, pp.123-151, 2003.

C. Beltran, C. Tadonki, and J. Vial, Solving the p-median problem with a semi-lagrangean relaxation, Computational Optimization and Applications, vol.35, issue.2, pp.239-260, 2006.

O. Briant and D. Naddef, The optimal diversity management problem, Operations Research, vol.52, issue.4, pp.515-526, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00363827

M. E. Captivo, The p -median problem: A survey of metaheuristic approaches, European Journal of Operations Research, vol.179, issue.3, pp.65-74, 2007.

N. Christophides and J. E. Beasley, A tree search algorithm for the pmedian problem, European Journal of Operations Research, vol.10, issue.2, pp.196-204, 1982.

I. R. De-farias, A family of facets for the uncapacited p median polytope, Operations Research Letters, vol.28, pp.161-167, 2001.

L. Escudero, M. Guignard, and K. Malik, A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships, Annals of Operations Research, vol.50, pp.219-237, 1994.

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness, 1979.

P. Hanjoul and D. Peeters, A comparasion of two dual-based procedures for solving the p-median problem, European Journal of Operational Research, vol.20, issue.3, pp.387-396, 1985.

P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Mathematical programming, vol.79, pp.191-215, 1997.

P. Hansen and N. Mladenovi?, Complement to a comparative analysis of heuristics for the p-median problem, Source, Statistics and Computing, vol.18, issue.1, pp.41-46, 2008.

M. Held and R. M. Karp, The travelling-salesman problem and minimum spanning trees, Operations Research, vol.18, pp.1138-1162, 1970.

A. Lucena, Non delay relax-and-cut algorithms, Annals of Operations Research, vol.140, pp.375-410, 2005.

P. B. Mirchandani, A. Oudjit, and R. T. Wong, Multidimensional extensions and a nested dual approach for the m-median problem, European Journal of Operations Research, vol.21, issue.1, pp.121-137, 1985.

C. Narula, U. I. Ogbu, and H. M. Samuelsson, An algorithm for the p-median problem, Operations Research, vol.25, issue.4, pp.709-713, 1977.

M. R. Rao, Cluster analysis and mathematical programming, Journal of the American Statical Association, vol.6, issue.335, pp.622-626, 1971.

J. Reese, Solutions methods for the p-median problem: an annotated bibliography, Networks, vol.48, issue.3, pp.125-142, 2006.

G. Reinelt, TSPLIB ? A traveling salesman problem library, ORSA Journal on Computing, vol.3, pp.376-384, 1991.

M. G. Resende and R. F. Werneck, On the implementation of a swapbased local search procedure for the p-median problem, Proceedings of the fifth workshop on algorithm engineering and experiments, pp.119-127, 2003.

M. G. Resende and R. F. Werneck, A hybrid heuristic for the pmedian problem, Journal of Heuristics, vol.10, issue.1, pp.59-88, 2004.

E. L. Senne and L. A. Lorena, Lagrangean/surrogate heuristics for p-medians problems. Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp.115-130, 2000.

B. C. Tansel, R. L. Francis, and T. J. Lowe, Location on networks: a survey part i: the p-center and p-median problems, Management Science, vol.29, issue.4, pp.482-497, 1983.

B. C. Tansel, R. L. Francis, and T. J. Lowe, Location on networks: a survey part ii: exploiting tree network structure, Management Science, vol.29, issue.4, pp.498-511, 1983.

M. B. Teitz and P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Operations Research, vol.16, issue.5, pp.955-961, 1968.

R. Whitaker, A fast algorithm for the greedy interchange of large-scale clustering and median location problems, Information systems and operations research (INFOR), vol.21, pp.95-108, 1983.