The Facility Location Problem with Limited Distances

In this paper we consider minisum and minimax single facility location problems where the effective service distance becomes a constant when the actual distance attains or exceeds a certain value. Properties of these problems are studied, and algorithms for their solution are presented.

[1]  Pierre Hansen,et al.  The Minisum and Minimax Location Problems Revisited , 1985, Oper. Res..

[2]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[3]  R. Love,et al.  A Stopping Rule for Facilities Location Algorithms , 1981 .

[4]  Zvi Drezner,et al.  The Planar Two-Center and Two-Median Problems , 1984, Transp. Sci..

[5]  Thomas L. Morin,et al.  COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING , 1978 .

[6]  Zvi Drezner,et al.  Single Facility lp-Distance Minimax Location , 1980, SIAM J. Algebraic Discret. Methods.

[7]  Martin E. Dyer,et al.  On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..

[8]  Mary W. Cooper,et al.  The use of dynamic programming methodology for the solution of a class of nonlinear programming problems , 1980 .

[9]  Peter J. Kolesar,et al.  An Algorithm for the Dynamic Relocation of Fire Companies , 1974, Oper. Res..

[10]  G. O. Wesolowsky.  Rectangular Distance Location under the Minimax Optimality Criterion , 1972 .

[11]  S. McLafferty,et al.  Patient outcomes and regional planning of coronary care services: a location-allocation approach. , 1990, Social science & medicine.

[12]  Z. Drezner.  Note-On a Modified One-Center Model , 1981 .

[13]  Z. Drezner.  The p-cover problem , 1986 .

[14]  Z. Drezner.  On the rectangular p‐center problem , 1987 .

[15]  Donald W. Hearn,et al.  Efficient Algorithms for the (Weighted) Minimum Circle Problem , 1982, Oper. Res..

[16]  Warren Walker,et al.  Using the Set-Covering Problem to Assign Fire Companies to Fire Houses , 1974, Oper. Res..

[17]  C. Watson-Gandy.  Heuristic procedures for the m-partial cover problem on a plane , 1982 .

[18]  G. O. Wesolowsky,et al.  A Maximin Location Problem with Maximum Distance Constraints , 1980 .

[19]  RICHARD C. LARSON,et al.  A hypercube queuing model for facility location and redistricting in urban emergency services , 1974, Comput. Oper. Res..

[20]  D. Hearn,et al.  Geometrical Solutions for Some Minimax Location Problems , 1972 .

[21]  James G. Morris,et al.  Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized "Distance" Function , 1981, Oper. Res..

[22]  Robert F. Love,et al.  Technical Note - A Generalized Bounding Method for Multifacility Location Models , 1989, Oper. Res..

[23]  Robert Rosenthal,et al.  Computer graphical solutions of constrained minimax location problems , 1980 .

[24]  Zvi Drezner.  A NOTE ON THE LOCATION OF MEDICAL FACILITIES , 1990 .