A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES

The multifacility minimax location problem with rectilinear distances is considered. It is reduced to a parametric shortest path problem in a network with no negative length arcs. The reduction scheme contributes to this location problem and yields an efficient algorithm with time complexity 0 (n max(m log m, n3 )) where n and m denote the numbers of the new and existing facilitie,s in the plane, respectively. For a special case the time bound is further reducible to 0 (n max(m, n ».

[1]  R. L. Francis,et al.  A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear Distances , 1974 .

[2]  Richard D. Smallwood,et al.  Minimax Detection Station Placement , 1965 .

[3]  Richard M. Karp,et al.  Parametric shortest path algorithms with an application to cyclic staffing , 1981, Discret. Appl. Math..

[4]  James G. Morris,et al.  A Linear Programming Approach to the Solution of Constrained Multi-Facility Minimax Location Problems where Distances are Rectangular , 1973 .

[5]  Richard L. Francis,et al.  Letter to the Editor - Some Aspects of a Minimax Location Problem , 1967, Oper. Res..

[6]  R. L. Francis.  A Geometrical Solution Procedure for a Rectilinear Distance Minimax Location Problem1 , 1972 .

[7]  H. Ishii,et al.  WEIGHTED MINIMAX REAL-VALUED FLOWS , 1981 .

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

[9]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[10]  D. Hearn,et al.  Letter to the Editor—A Note on a Minimax Location Problem , 1973 .

[11]  Margaret K. Schaefer,et al.  An algorithm for the solution of a location problem with metric constraints , 1974 .

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

[13]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

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

[15]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[16]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Timothy J. Lowe,et al.  Distance Constraints for Tree Network Multifacility Location Problems , 1978, Oper. Res..