]. S. Abiteboul, Querying semi-structured data, Proceedings of ICDT, pp.1-18, 1997.
DOI : 10.1007/3-540-62222-5_33

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

V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala et al., Local Search Heuristics for k-Median and Facility Location Problems, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 2001.
DOI : 10.1137/s0097539702416402
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.7278

P. Avella and A. Sassano, On the p-Median polytope, Mathematical Programming, vol.89, issue.3, pp.395-411, 2001.
DOI : 10.1007/PL00011405

P. Avella, A. Sassano, and I. Vasil-'ev, Computational study of large-scale p-Median problems, Mathematical Programming, vol.21, issue.1, pp.89-114, 2007.
DOI : 10.1007/s10107-005-0700-6

M. Ba¨?ouba¨?ou and F. Barahona, On the <mml:math altimg="si16.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>p</mml:mi></mml:math>-median polytope of <mml:math altimg="si17.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>Y</mml:mi></mml:math>-free graphs, Discrete Optimization, vol.5, issue.2, pp.205-219, 2008.
DOI : 10.1016/j.disopt.2006.09.002

M. Ba¨?ouba¨?ou and F. Barahona, On the Integrality of Some Facility Location Polytopes, SIAM Journal on Discrete Mathematics, vol.23, issue.2, pp.665-679, 2009.
DOI : 10.1137/070706070

M. Ba¨?ouba¨?ou and F. Barahona, On the linear relaxation of the <mml:math altimg="si35.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>p</mml:mi></mml:math>-median problem, Discrete Optimization, vol.8, issue.2, pp.344-375, 2011.
DOI : 10.1016/j.disopt.2010.12.002

M. Ba¨?ouba¨?ou, F. Barahona, and J. R. Correa, -Median Polytope and the Intersection Property: Polyhedra and Algorithms, SIAM Journal on Discrete Mathematics, vol.25, issue.1, pp.1-20, 2011.
DOI : 10.1137/090747440

M. Ba¨?ouba¨?ou and F. Barahona, On a connection between facility location and perfect graphs

M. L. Balinski, Integer Programming: Methods, Uses, Computations, Management Science, vol.12, issue.3, pp.253-313, 1965.
DOI : 10.1287/mnsc.12.3.253

F. Barahona and F. Chudak, Solving large scale uncapacitated facility location problems, " NONCONVEX OPTIMIZATION AND ITS APPLI- CATION, Approximation and Complexity in Numerical Optimization, Continuos and Discrete Problems, pp.48-62, 2000.

F. Barahona and L. Ladanyi, An implementation of the Volume Algorithm Coin-or Documentation (2006) available at URL https://projects.coin-or.org/svn

Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of 37th Conference on Foundations of Computer Science, pp.184-193, 1996.
DOI : 10.1109/SFCS.1996.548477

Y. Bartal, On approximating arbitrary metrices by tree metrics, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.161-168, 1998.
DOI : 10.1145/276698.276725

W. J. Baumol and P. Wolfe, A Warehouse-Location Problem, Operations Research, vol.6, issue.2, pp.252-263, 1958.
DOI : 10.1287/opre.6.2.252

J. E. Beasley, A note on solving large p-median problems, European Journal of Operational Research, vol.21, issue.2, pp.270-273, 1985.
DOI : 10.1016/0377-2217(85)90040-2

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

J. E. Beasley, OR-library: distributing test problems by electronic mail The Management School, Imperial College (available at URL http

P. Belotti, M. Labbé, F. Maffioli, and M. Ndiaye, A branch-and-cut method for the obnoxious p-median problem, 4OR, vol.19, issue.3, pp.299-314
DOI : 10.1007/s10288-006-0023-3

O. Berman, Z. Drezner, A. Tamir, and G. O. Wesolowsky, Optimal location with equitable loads, Annals of Operations Research, vol.34, issue.8, pp.307-325, 2009.
DOI : 10.1007/s10479-008-0339-9

O. Briant and D. Naddef, The Optimal Diversity Management Problem, Operations Research, vol.52, issue.4, pp.515-526, 2004.
DOI : 10.1287/opre.1040.0108
URL : https://hal.archives-ouvertes.fr/hal-00363827

P. Bunemane, Semistructured data, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '97, 1997.
DOI : 10.1145/263661.263675

P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu, A query language and optimization techniques for unstructured data, Proceedings of the ACM SIGMOD International Conference, pp.505-516, 1996.

L. Cánovas, S. García, M. Labbé, and A. Marín, A strengthened formulation for the simple plant location problem with order, Operations Research Letters, vol.35, issue.2, pp.141-150, 2007.
DOI : 10.1016/j.orl.2006.01.012

L. Cánovas, M. Landete, and A. Marín, On the facets of the simple plant location packing polytope, Discrete Applied Mathematics, vol.124, issue.1-3, pp.27-53, 2002.
DOI : 10.1016/S0166-218X(01)00328-6

M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999.
DOI : 10.1109/SFFCS.1999.814609

M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys, A Constant-Factor Approximation Algorithm for the k-Median Problem, STOC'99 Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp.1-10, 1999.
DOI : 10.1006/jcss.2002.1882

M. Charikar, C. Chekuri, A. Goel, and S. Guha, Rounding via trees, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.114-123, 1998.
DOI : 10.1145/276698.276719

M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys, A Constant-Factor Approximation Algorithm for the k-Median Problem, Journal of Computer and System Sciences, vol.65, issue.1, pp.129-149, 2002.
DOI : 10.1006/jcss.2002.1882

D. C. Cho, E. L. Johnson, M. Padberg, and M. Rao, On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets, Mathematics of Operations Research, vol.8, issue.4, pp.579-589, 1983.
DOI : 10.1287/moor.8.4.579
URL : https://hal.archives-ouvertes.fr/inria-00076475

D. C. Cho, M. Padberg, and M. Rao, On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems, Mathematics of Operations Research, vol.8, issue.4, pp.590-612, 1983.
DOI : 10.1287/moor.8.4.590
URL : https://hal.archives-ouvertes.fr/inria-00076475

M. Chrobak, L. L. Larmore, and W. Rytter, The k-Median Problem for Directed Trees, Lecture Notes on Computer Science, pp.2136-260, 2001.
DOI : 10.1007/3-540-44683-4_23

R. L. Chuch, COBRA: a new formulation of the classic p-median location problem, Annals of Operations Research, vol.122, pp.103-120, 2003.

R. L. Church and J. L. Cohon, Multiobjective location analysis of regional energy facility siting problems, Report preparated for the U. S. Energy Research and Development Administration
DOI : 10.2172/7294043

R. L. Church and K. L. Roberts, GENERALIZED COVERAGE MODELS AND PUBLIC FACILITY LOCATION, Papers in Regional Science, vol.53, issue.1, pp.117-135, 1983.
DOI : 10.1111/j.1435-5597.1983.tb00807.x

G. Cornuéjols, M. L. Fisher, and G. L. Nemhauser, 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. Cornuéjols, G. L. Nemhauser, and L. Wolsey, A Canonical Representation of Simple Plant Location Problems and Its Applications, SIAM Journal on Algebraic Discrete Methods, vol.1, issue.3, pp.261-272, 1980.
DOI : 10.1137/0601030

G. Cornuéjols and J. Thizy, Some facets of the simple plant location polytope, Mathematical Programming, vol.15, issue.1, pp.50-74, 1982.
DOI : 10.1007/BF01583779

N. Christofides and J. E. Beasley, A tree search algorithm for the p-median problem, European Journal of Operational Research, vol.10, issue.2, pp.196-204, 1982.
DOI : 10.1016/0377-2217(82)90160-6

I. R. De-farias, A family of facets for the uncapacitated p-median polytope, Operations Research Letters, vol.28, issue.4, pp.161-167, 2001.
DOI : 10.1016/S0167-6377(01)00062-1

S. De-vries, M. E. Posner, and R. V. Vohra, Polyhedral Properties of the K-median Problem on a Tree, Mathematical Programming, vol.10, issue.2, pp.261-285, 2003.
DOI : 10.1007/s10107-006-0002-7

G. Dobson and U. S. Karmarkar, Competitive Location on a Network, Operations Research, vol.35, issue.4, pp.565-574, 1987.
DOI : 10.1287/opre.35.4.565

M. Efroymson and T. Ray, A Branch-Bound Algorithm for Plant Location, Operations Research, vol.14, issue.3, pp.361-368, 1966.
DOI : 10.1287/opre.14.3.361

S. Elloumi, A tighter formulation of the p-median problem, Journal of Combinatorial Optimization, vol.2, issue.1, pp.69-83, 2010.
DOI : 10.1007/s10878-008-9162-0
URL : https://hal.archives-ouvertes.fr/hal-01125528

F. García-lópez, B. Melián-batista, J. A. Moreno-pérez, and J. M. Moreno-vega, The Parallel variable neighborhood search for the p-median problem, Journal of Heuristics, vol.8, issue.3, pp.375-388, 2002.
DOI : 10.1023/A:1015013919497

M. R. Garey and D. S. Johnson, Computers and intractability: A Guide to the theory pf mathcalN P -completeness, 1979.

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

R. A. Gerrard and R. L. Church, Closest assignment constraints and location models: Properties and structure, Location Science, vol.4, issue.4, pp.251-270, 1996.
DOI : 10.1016/S0966-8349(97)00001-6

M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.70-89, 1981.
DOI : 10.1007/BF02579273

M. Guinard, Fractional vertices, cuts and facets of the simple plant location problem, Mathematical Programming Study, pp.150-162, 1980.
DOI : 10.1007/BFb0120893

S. L. Hakimi, Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph, Operations Research, vol.12, issue.3, pp.450-459, 1964.
DOI : 10.1287/opre.12.3.450

S. L. Hakimi, Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems, Operations Research, vol.13, issue.3, pp.462-475, 1965.
DOI : 10.1287/opre.13.3.462

P. Hanjoul and D. Peeters, A facility location problem with clients' preference orderings, Regional Science and Urban Economics, vol.17, issue.3, pp.451-473, 1987.
DOI : 10.1016/0166-0462(87)90011-1

P. Hanjoul, P. Hansen, D. Peeters, and J. F. Thisse, Uncapacitated Plant Location Under Alternative Spatial Price Policies, Management Science, vol.36, issue.1, pp.36-41, 1990.
DOI : 10.1287/mnsc.36.1.41

P. Hansen and N. Mladenovi´cmladenovi´c, Variable neighborhood search for the p-median, Location Science, vol.5, issue.4, pp.207-226, 1997.
DOI : 10.1016/S0966-8349(98)00030-8

P. Hansen, N. Mladenovi´cmladenovi´c, and D. Perez-brito, Variable neighborhood decomposition search, Journal of Heuristics, vol.7, issue.4, pp.335-350, 2001.
DOI : 10.1023/A:1011336210885

R. Hassin and A. Tamir, Improved complexity bounds for location problems on the real line, Operations Research Letters, vol.10, issue.7, pp.395-402, 1991.
DOI : 10.1016/0167-6377(91)90041-M

R. W. Hause and T. Rado, On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems, Journal of the Association Computing Machinery, pp.48-77, 1963.

M. Held and R. M. Karp, The Traveling-Salesman Problem and Minimum Spanning Trees, Operations Research, vol.18, issue.6, pp.1138-1162, 1970.
DOI : 10.1287/opre.18.6.1138

M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees: Part II, Mathematical Programming, vol.6, issue.1, pp.6-25, 1971.
DOI : 10.1007/BF01584070

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

M. J. Hodgson, Toward More Realistic Allocation in Location???Allocation Models: An Interaction Approach, Environment and Planning A, vol.14, issue.6, pp.1273-1285, 1978.
DOI : 10.1068/a101273

W. L. Hsu, The distance-domination numbers of trees, Operations Research Letters, vol.1, issue.3, pp.96-100, 1982.
DOI : 10.1016/0167-6377(82)90005-0

K. Jain and V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999.
DOI : 10.1109/SFFCS.1999.814571

K. Jain and V. Vazirani, Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation, Journal of the ACM, vol.48, issue.2, pp.274-296, 2001.
DOI : 10.1145/375827.375845

P. Jarvinen, J. Rajala, and J. Sinerro, -Median, Operations Research, vol.20, issue.1, pp.173-178, 1972.
DOI : 10.1287/opre.20.1.173
URL : https://hal.archives-ouvertes.fr/hal-00260017

O. Kariv and S. L. Hakimi, -Medians, SIAM Journal on Applied Mathematics, vol.37, issue.3, pp.539-560, 1979.
DOI : 10.1137/0137041

R. Karp and C. Papadimitriou, On linear characterization of combinatorial optimization problems, Proceedings of the Twenty-first annual Symposium on the Foundation of Computer Science, pp.1-9, 1980.

L. G. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.191-194, 1979.
DOI : 10.1016/0041-5553(80)90061-0

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

]. B. Li, X. Deng, M. J. Golin, and K. Sohraby, On the optimal placement of Web proxies on the Internet, Proc. 8th IFIP Conference on High Performance Nteworking (HPN'98), 1998.

J. Lin and J. S. Vitter, -approximation with minimum packing constraint violation, proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp.771-782, 1992.
DOI : 10.1145/129712.129787
URL : https://hal.archives-ouvertes.fr/hal-00109057

A. S. Manne, Plant Location Under Economies-of-Scale???Decentralization and Computation, Management Science, vol.11, issue.2, pp.213-235, 1964.
DOI : 10.1287/mnsc.11.2.213

M. P. Marcus, Switching Circuits for Engineers, N. J, 1962.

A. Marín, The discrete facility location problem with balanced allocation of customers, European Journal of Operational Research, vol.210, issue.1, pp.27-38, 2011.
DOI : 10.1016/j.ejor.2010.10.012

N. Megiddo and K. J. Supowit, On the Complexity of Some Common Geometric Location Problems, SIAM Journal on Computing, vol.13, issue.1, pp.182-196, 1984.
DOI : 10.1137/0213014

G. Melançon, I. Dutour, and M. Bousquet-mélou, Random Generation of Directed Acyclic Graphs, Electronic Notes in Discrete Mathematics, vol.10, pp.202-207, 2001.
DOI : 10.1016/S1571-0653(04)00394-4

P. B. Mirchandani and R. L. Francis, Discrete location theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990.

J. G. Morris, On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP, Journal of the Operational Research Society, vol.29, issue.1, pp.71-76, 1978.
DOI : 10.1057/jors.1978.10

G. L. Nemhauser and L. A. Wolsey, Interger and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372
URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

S. Nestorov, S. Abiteboul, and R. Motawani, Extracting Schema from Semistructured Data " SIGMOD Rec, pp.295-306, 1998.
DOI : 10.1145/276305.276331
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.302

M. W. Padberg and M. Rao, The Russian method for linear inequalities III: Bounded integer programs, pp.81-120, 1981.

C. H. Papadimitriou, Worst-Case and Probabilistic Analysis of a Geometric Location Problem, SIAM Journal on Computing, vol.10, issue.3, pp.542-557, 1981.
DOI : 10.1137/0210040

M. G. Resende and R. F. Werneck, A GRASP with path-relinking for the p-median problem, p.7932, 2002.

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 Experi(ALENEX'03), pp.119-127, 2003.

M. G. Resende and R. F. Werneck, A Hybrid Heuristic for the p-Median Problem, Journal of Heuristics, vol.10, issue.1, pp.59-88, 2004.
DOI : 10.1023/B:HEUR.0000019986.96257.50

G. Reinelt, TSPLIB???A Traveling Salesman Problem Library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991.
DOI : 10.1287/ijoc.3.4.376

P. Rojeski and C. S. Revelle, Central Facilities Location under an Investment Constraint, Geographical Analysis, vol.2, issue.4, pp.343-360
DOI : 10.1111/j.1538-4632.1970.tb00864.x

K. E. Rosing, C. S. Revelle, and H. Rosing-vogelaar, The p-Median and its Linear Programming Relaxation: An Approach to Large Problems, Journal of the Operational Research Society, vol.30, issue.9, pp.815-823, 1979.
DOI : 10.1057/jors.1979.192

M. P. Scaparra and R. L. Church, A bilevel mixed-integer program for critical infrastructure protection planning, Computers & Operations Research, vol.35, issue.6, pp.1905-1923, 2008.
DOI : 10.1016/j.cor.2006.09.019

L. Schrage, Implicit representation of variable upper bounds in linear programming, Mathematical Programming Study, vol.4, pp.118-132, 1975.
DOI : 10.1007/BFb0120715

K. Spielberg, Algorithms for the Simple Plant-Location Problem with Some Side Conditions, Operations Research, vol.17, issue.1, pp.85-111, 1969.
DOI : 10.1287/opre.17.1.85

G. Stauffer, The -median polytope of -free graphs: An application of the matching theory, Operations Research Letters, vol.36, issue.3, pp.351-354, 2008.
DOI : 10.1016/j.orl.2007.09.006
URL : https://hal.archives-ouvertes.fr/inria-00442282

A. Tamir, An O(pn2) algorithm for the p-median and related problems on tree graphs, Operations Research Letters, vol.19, issue.2, pp.59-64, 1996.
DOI : 10.1016/0167-6377(96)00021-1

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.
DOI : 10.1287/opre.16.5.955

J. C. Texeira and A. P. Antunes, A hierarchical location model for public facility planning, European Journal of Operational Research, vol.185, issue.1, pp.92-104, 2008.
DOI : 10.1016/j.ejor.2006.12.027

M. J. Todd, An implementation of the simplex method for linear programming problems with variable upper bounds, Mathematical Programming, vol.2, issue.1, pp.34-49, 1982.
DOI : 10.1007/BF01583778

J. D. Ullman, Principles of Database and Knowledge-Base Systems, Volume I,II, 1989.

A. Vigneron, L. Gao, M. J. Golin, G. F. Italiano, and B. Li, An algorithm for finding a -median in a directed tree, Information Processing Letters, vol.74, issue.1-2, pp.81-88, 2000.
DOI : 10.1016/S0020-0190(00)00026-0

J. L. Wagner and L. M. Falkson, The Optimal Nodal Location of Public Facilities With Price-Sensitive Demand, Geographical Analysis, vol.22, issue.1, pp.69-83, 1975.
DOI : 10.1111/j.1538-4632.1975.tb01024.x

R. Whitaker, A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems, INFOR: Information Systems and Operational Research, vol.21, issue.2, pp.95-108, 1983.
DOI : 10.1080/03155986.1983.11731889

]. P. Wolfe, A method of conjugate subgradients for minimizing nondifferentiable functions, Mathematical Programming Study, vol.3, pp.145-173, 1975.
DOI : 10.1007/BFb0120703

W. Zhao and M. E. Posner, A large class of facets for the K-median polytope, Mathematical Programming, vol.19, issue.1-2, pp.171-203, 2011.
DOI : 10.1007/s10107-009-0301-x