On the p-Median polytope

Mathematical Programming, Series B

Volumn 89, Issue 3, 2001, Pages 395-411

  Avella, Pasquale ^a   Sassano, Antonio ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000485499     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011405     Document Type: Article

References (27)

1. Avella, P., Sassano, A. (1994): On the p-Median polytope. Technical Report 22/94, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Italy
2. Beasley, J.E. (1985): A note on solving large scale p-Median problems. EJOR 21, 270-273
3. Beasley, J.E. (1993): Lagrangean heuristics for location problems. EJOR 65, 383-399
4. Beasley, J.E. (1994): OR-library: distributing test problems by electronic mail. Technical Report, The Management School, Imperial College (available at URL www.mscmga.ic.ac.uk)
5. Cho, D.C., Johnson, E.L., Padberg, M.W., Rao, M.R. (1983): On the uncapacitated plant location problem. I: valid inequalities and facets. Math, of O.R. 8, 579-589
6. Cho, D.C., Johnson, E.L., Padberg, M.W., Rao, M.R. (1983): On the uncapacitated plant location problem. II: facets and lifting theorems. Math, of O.R. 8, 590-612
7. Christofides, N., Beasley, J.E. (1982): A tree search algorithm for the p-median problem. EJOR 10, 196-204
8. Cornuejols, G., Fisher, M.L., Nemhauser, G.L. (1977): Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manage. Sci. 23, 789-810
9. Cornuejols, G., Thizy, J.M. (1982): Some facets of the simple plant location problem. Math. Program. 23, 50-74
10. Erlenkotter, D. (1979): A dual-based procedure for the uncapacitated plant location problem. Oper. Res. 26, 992-1009
11. Galvao, R.D. (1980): A dual-bounded algorithm for the p-Median problem, Oper. Res. 28, 1112-1121
12. Kariv, O., Hakimi, L. (1979): An algorithmic approach to network location problems. II: the p-medians. SIAM J. Appl. Math. 37, 539-560
13. Maurras, J.F. (1983): Convex hull of the edges of a graph and near bipartite graphs. Disc. Math. 46, 257-265
14. Mirchandani, P., Francis, R.L. (1990): Discrete Location Theory. Wiley
15. Mirchandani, P.B., Oudjit, A., Wong, R.T. (1985): 'Multidimensional' extensions and a nested dual approach for the m-median problem. EJOR 21, 121-137
16. Mulvey, J.M., Crowder, H.P. (1979): Cluster Analysis: an application of lagrangian relaxation. Manage. Sci. 25, 329-340
17. Nemhauser, G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. Wiley
18. Nemhauser, G.L., Sigismondi, G. (1992): A strong cutting plane/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. 43, 443-457
19. Nemhauser, G.L., Trotter, L.E. (1974): Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48-61
20. Padberg, M.W. (1973): On the facial structure of set packing polyhedra. Math. Program. 5, 199-215
21. Rolland, E., Schilling, D.A., Current, J.R. (1996): An efficient tabu search procedure for the p-Median problem. EJOR 96, 329-342
22. Teitz, M.B., Bart, P. (1968): Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. 16, 955-961
23. Wang, Y. (1996): The p-median problem and the uncapacitated facility location problem. Ph.D. Thesis, Dept. of Mathematics and Statistics, Carleton University, Canada
24. Wang, Y. (2000): Personal communication
25. Whitaker, R.A. (1983): A fast agorithm for the greedy interchange for large-scale clustering and median location problems. Canad. J. Oper. Res. Inform. Processing 21, 95-108
26. Wolsey, L.A. (1976): Further facet generating procedures for vertex packing polytopes. Math. Program. 11, 158-163
27. Ward, J.E., Wong, R.T., Lemke, P., Oudjit, A. (1988): Properties of the k-Median linear programming relaxation. Technical Report, Rensselaer Polytechnic Institute