BEAMR: An exact and approximate model for the p-median problem

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 417-426

  Church, Richard L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation approach; Integer programming; p median; Variable reduction

Indexed keywords

COMPUTATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; TRACKING (POSITION);

EXTENDED MODEL FORMATS; INTEGER-LINEAR FORMULATION; LOCATION-ALLOCATION MODELS; P-MEDIAN PROBLEM; VARIABLE REDUCTION;

APPROXIMATION THEORY;

EID: 34447092666     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.03.006     Document Type: Article

References (28)

1. Hakimi S.L. Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research 12 (1964) 450-459
2. Hakimi S.L. Optimum distribution of switching centers and some graph related theoretic problems. Operations Research 13 (1965) 462-475
3. Teitz M.B., and Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16 (1968) 955-961
4. ReVelle C.S., and Swain R. Central facilities location. Geographical Analysis 2 (1970) 30-42
5. Kariv O., and Hakimi S.L. An algorithmic approach for network location problems II: the p-medians. SIAM Journal on Applied Mathematics 37 (1979) 539-560
6. Narula S.C., Ogubu U.I., and Samuelson H.M. An algorithm for the p-median problem. Operations Research 25 (1977) 709-713
7. Weaver J.R., and Church R.L. A median location model with nonclosest facility service. Transportation Science 19 (1985) 58-74
8. Hillsman EL. A system for location-allocation analysis. PhD dissertation, University of Iowa, Iowa City; 1979.
9. Rosing K.E., and ReVelle C.S. Heuristic concentration: two stage solution concentration. European Journal of Operational Research 97 (1997) 75-86
10. 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 (1979) 815-822
11. Church R.L. COBRA: a new formulation of the classic p-median location problem. Annals of Operations Research 122 (2003) 103-120
12. Beasley J.E. A note on solving large p-median problems. European Journal of Operational Research 21 (1985) 270-273
13. Evans J.R., and Minieka E. Optimization algorithms for networks and graphs. 2nd ed. (1992), Marcel Dekker, Inc., New York
14. ReVelle C.S. Facility siting and integer friendly programming. European Journal of Operational Research 65 (1993) 147-158
15. Whitaker R.A. A tight bound drop exchange algorithm for solving the p-median problem. Environment and Planning A 13 (1981) 669-680
16. Murray A.T., and Church R.L. Applying simulated annealing to location-planning models. Journal of Heuristics 2 (1996) 31-53
17. Hosage C., and Goodchild M. Discrete space location-allocation solutions from genetic algorithms. Annals of Operations Research 6 (1986) 35-46
18. Rolland E., Schilling D., and Current J.R. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96 (1996) 329-342
19. Hansen P., and Mladenovic N. Variable neighborhood search for the p-median problem. Location Science 5 (1997) 207-226
20. Resende MGC, Werneck RF. A GRASP with path-relinking for the p-median problem. AT&T Labs Technical Report TD-5E53XL, Florham Park, NJ, 2002.
21. Beasley J.E. Lagrangean heuristics for location problems. European Journal of Operational Research 65 (1993) 383-399
22. Hanjuol P., and Peters D. A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research 20 (1985) 387-396
23. Erlenkotter D. A dual based procedure for uncapacitated facility location. Operations Research 26 (1978) 992-1009
24. Balinski M. Integer programming methods, uses and computation. Management Science (Series A) 12 (1965) 253-313
25. Densham P.J., and Rushton G. Strategies for solving large location-allocation problems by heuristic methods. Environment and Planning A 24 (1992) 289-304
26. Densham P.J., and Rushton G. A more efficient heuristic for solving large p-median problems. Papers in Regional Science 71 (1992) 307-329
27. Sorensen P.A., and Church R.L. A comparison of strategies for data storage reduction in location-allocation problems. Geographical Systems 3 (1996) 221-242
28. Senne ELF, Lorena LAN, Pereira MA. A branch and price approach to p-median problems. Unpublished manuscript, 2003.