On optimal location with threshold requirements

Socio-Economic Planning Sciences

Volumn 33, Issue 2, 1999, Pages 91-103

  Carreras, Miquel ^a   Serra, Daniel ^b  

^a Universitqt de Girona   (Spain)

^b DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

LOCATION DECISION; LOCATION THEORY; METHODOLOGY; RURAL AREA; SERVICE PROVISION;

SPAIN;

EID: 0033150356     PISSN: 00380121     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0038-0121(98)00005-6     Document Type: Article

References (32)

1. Balakrishnan P, Desai A, Storbeck J. Efficiency evaluation of retail outlet networks. Environment and Planning B - Planning and Design 1994;21(4):477-88.
2. Balakrishnan P, Storbeck J. Mctresh: modeling maximum coverage with threshold constraints. Environment and Planning B - Planning and Design 1991;18(4):459-72.
3. p) medianoid and (r\p) centroid problems. Location Science 1994;2(4):193-204.
4. Cornuejols G, Sridharan R, Thizy J. A comparison of heuristics and relaxations for the capacitated plant location problem. European Journal of Operational Research 1991;50:280-97.
5. Current J, Storbeck J. Capacitated covering models. Environment and Planning B 1988;15:153-64.
6. Current J, Storbeck J. A multiobjective approach to design franchise outlet networks. Journal of Operational Research Society 1994;45:71-81.
7. Davis P, Ray T. A branch and bound algorithm for the capacitated facilities location problem. Naval Research Logistics Quarterly 1969;4(4):331-4.
8. Densham P, Rushton G. A more efficient heuristic for solving large p-median problems. Papers in Regional Science 1992;71:307-27.
9. Densham P, Rushton G. Strategies for solving large location-allocation problems by heuristic methods. Environment and Planning A 1992;24:289-304.
10. Galvao R. The use of lagrangean relaxation in the solution of uncapacitated facility location problems. Location Science 1993;1(1):57-70.
11. Gendreau M, Hertz A, Laporte G. A tabu search algorithm for the vehicle routing problem. Management Science 1994;40:1276-90.
12. Goeffrion A. Lagragean relaxation for integer programming. Mathematical Programming Study 1974;2:82-114.
13. Gerrard Ross, Church Richard. Closest assignment constraints and location models: properties and structure. Location Science 1994;4(4):251-70.
14. Ghosh A, Craig S. Fransys: a franchise distribution system location model. Journal of Retailing 1991;67(4):466-89.
15. Gisbert R, Rovira R, Ilia R. Analisis de los modelos alternativos de retribucion de las oficinas de farmacia. Technical Report 95-25. FEDEA, 1995.
16. Glover F. Heuristic for integer programming using surrogate constraints. Decision Sciences 1977;8:156-66.
17. Glover F. Tabu search, part 1. ORSA Journal of Computing 1989;1:190-206.
18. Glover F. Tabu search, part 2. ORSA Journal of Computing 1989;2:4-32.
19. Glover F, Laguna M Tabu search. In: Reeves C, editor. Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell, 1993.
20. Golden B, Bodin L, Doyle T, Stewart W. Approximate traveling salesman algorithms. Operations Research 1980;28:694-711.
21. Klincewicz J. Avoiding local optima in the p-hub location problem using tabu and grasp. Annals of Operations Research 1992;40:121-32.
22. Pirkul H, Schilling D. The maximal covering location problem with capacities on total workload. Management Science 1991;37(2):233-48.
23. ReVelle C. Facility siting and integer-friendly programming. European Journal of Operational Research 1993;65:147-58.
24. ReVelle C, Swain R. Central facilities location. Geographical Analysis 1970;2:30-42.
25. Rojeski G, ReVelle C. Central facilities location under an investment constraint. Geographical Analysis 1970;2:343-60.
26. Rolland E, Schilling D, Current J. An efficient search procedure for the P-median problem. European Journal of Operational Research 1996;96:329-42.
27. Rosing K, Hillsman E, Rosing-Vogelaar H. A note comparing optimal and heuristic solutions to the P-median problem. Geographical Analysis 1979;11:86-9.
28. Rosing K, ReVelle C, Rosing-Vogelaar H. The p-median model and its linear programming relaxation: an approach to large problems. Journal of the Operational Research Society 1979;30(9):815-23.
29. Skorin-Kapov J. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 1990;2:33-45.
30. Tietz M B, Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 1968;16:955-65.
31. Van-Laarhoven P, Aarts E. Simulated Annealing: Theory and Applications. Netherlands: Kluwer Academic Press, 1987.
32. Wagner C, Falkson F. The optimal nodal location of public facilities with price sensitive demand. Geographical Analysis 1975;7:69-83.