Fast and robust techniques for the euclidean p-median problem with uniform weights

Computers and Industrial Engineering

Volumn 57, Issue 3, 2009, Pages 896-905

  Lim, G J ^a   Reese, J ^b   Holder, A ^c  

^a UNIVERSITY OF HOUSTON   (United States)

^b PROS Revenue Management   (United States)

^c ROSE HULMAN INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Facility location; Lloyd algorithm; p Median; Vector quantization; Vertex substitution

Indexed keywords

CURRENT TECHNIQUES; EUCLIDEAN; FACILITY LOCATION; LLOYD ALGORITHM; NEW SOLUTIONS; P-MEDIAN; P-MEDIAN PROBLEMS; ROBUST TECHNIQUE; SOLUTION TIME; VERTEX SUBSTITUTION;

FACILITIES; HEURISTIC ALGORITHMS;

VECTOR QUANTIZATION;

EID: 69649095951     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.03.016     Document Type: Article

References (17)

1. Daskin M.S. Network and discrete location: Models, algorithms, and applications (1995), John Wiley & Sons, Inc, New York
2. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness (1979), W.H. Freeman and Co, San Francisco
3. Gersho A., and Gray R.M. Vector quantization and signal compression. Kluwer international series in engineering and computer science (1992), Kluwer Academic Publishers
4. Hakimi S.L. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12 3 (1964) 450-459
5. Hakimi S.L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research 13 3 (1965) 462-475
6. Hansen P., and Mladenović N. Variable neighborhood search for the p-median. Location Science 5 4 (1997) 207-226
7. Holder, A., Lim, G., Reese, J. (2007). The relationship between discrete vector quantization and the p-median problem. Technical report 102. San Antonio, TX: Trinity University.
8. Kariv O., and Hakimi S.L. An algorithmic approach to network location problems. II. The p-medians. SIAM Journal on Applied Mathematics 37 3 (1979) 539-560
9. Lloyd S.P. Least squares quantization in PCM. IEEE Transactions on Information Theory 28 (1982) 129-137
10. Maranzana F.E. On the location of supply points to minimize transport costs. Operational Research Quarterly 15 3 (1964) 261-270
11. In: Mirchandani P.B., and Francis R. (Eds). Discrete location theory. Wiley-Interscience series in discrete mathematics and optimization (1990), John Wiley & Sons, Inc, New York
12. Reese J. Solution methods for the p-median problem: An annotated bibliography. Networks 48 3 (2006) 125-142
13. Resende M.G.C., and Werneck R.F. On the implementation of a swap-based local search procedure for the p-median problem. In: Ladner R. (Ed). ALENEX'03: Proceedings of the fifth workshop on algorithm engineering and experiments (2003), SIAM, Philadelphia 119-127
14. ReVelle C., and Swain R. Central facilities location. Geographical Analysis 2 (1970) 30-42
15. Rosing K.E., ReVelle C.S., and Rosing-Vogelaar H. The p-median and its linear programming relaxation: An approach to large problems. Journal of the Operational Research Society 30 9 (1979) 815-823
16. Teitz M.B., and Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16 5 (1968) 955-961
17. Whitaker R.A. A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR 21 2 (1983) 95-108