An Evaluation of the Dual as a Lower Bound in Facilities Location Problems

References

• Dowling , P. and Love , R. F. , “ Bounding Methods for Facilities Location Algorithms ”, Faculty of Business, McMaster University , Research and Working Paper Series No. 219, revised version, December 1984 .
   Google Scholar
• Drezner , Z. , “ The Two-Center and Two-Median Problems ”, Transportation Science , 18 , 351 – 361 ( 1984 ).
   Web of Science ®Google Scholar
• Elzinga , D. J. and Hearn , D. W. , “ On Stopping Rules for Facilities Location Algorithms ”, HE Transactions , 15 , 81 – 82 ( 1983 ).
   Google Scholar
• Juel , H. , “ On a Rational Stopping Rule for Facilities Location Algorithms ”, Proceedings, 14th Annual Meeting, Southeastern Chapter, The Institute of Management Science , Atlanta, GA, October, 56–60 ( 1978 ).
   Google Scholar
• Juel , H. , “ On a Rational Stopping Rule for Facilities Location Algorithms ”, Naval Research Logistics Quarterly , 31 , 9 – 11 ( 1984 ).
   Google Scholar
• Juel , H. and Love , R. F. , “ Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms ”, Journal of the Operational Research Society , 32 , 891 – 897 ( 1981 ).
   Web of Science ®Google Scholar
• Katz , I. N. , “ On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems ”, SIAM Journal of Applied Mathematics , ( 1969 ) 17 , 6 , 1224 – 1231 .
   Web of Science ®Google Scholar
• Katz , I. N. , “ Local Convergence in Fermat's Problem ”, Mathematical Programming , 6 , 89 – 104 ( 1969 ).
   Google Scholar
• Kuhn , H. W. , “ A Note on Fermat's Problem ”, Mathematical Programming , 4 , 98 – 107 ( 1973 ).
   Google Scholar
• Love , R. F. , “ The Dual of a Hyperbolic Approximation to the Generalized Constrained Multi-Facility Location Problem with l p Distances ”, Management Science , 21 , 22 – 33 ( 1974 ).
   Web of Science ®Google Scholar
• Love , R. F. and Yeong , W. Y. , “ A Rational Stopping Rule for Facilities Location Algorithms ”, Wisconsin Working Paper 4–78-11, Graduate School of Business, University of Wisconsin , April ( 1978 ) ,
   Google Scholar
• Love , R. F. and Yeong , W. Y. , “ A Stopping Rule for Facilities Location Algorithms ”, AHE Transactions , 13 , 357 – 362 ( 1981 ).
   Google Scholar
• Love , R. F. , Truscott , W. G. and Walker , J. H. , “ Terminal Location Problem: A Case Study Supporting the Status Quo ”, Journal of the Operational Research Society , 36 , 131 – 136 ( 1985 ).
   Web of Science ®Google Scholar
• Morris , J. G. , “ Convergence of the Weiszfeld Algorithm for Weber Problems using a Generalized Distance Function ”, Operations Research , 29 , 37 – 48 ( 1981 ).
   Web of Science ®Google Scholar
• Morris , J. G. and Verdini , W. A. , “ Minisum l p Distance Location Problems Solved Via a Perturbed Problem and Weiszfeld's Algorithm ”, Operations Research , 27 , 1180 – 1188 ( 1979 ).
   Web of Science ®Google Scholar
• Ostresh , L. M. , “ On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem ”, Operations Research , 26 , 597 – 609 ( 1978 ).
   Web of Science ®Google Scholar
• Rosen , J. , “ The Gradient Projection Method for Nonlinear Programming, I. Linear Constraints ”, Journal of the Society of Industrial and Applied Mathematics , 8 , 181 – 217 ( 1960 ).
   Web of Science ®Google Scholar
• Weiszfeld , E. , “ Sur le point lequel la somme des distances de n points donnés est minimum ”, Tohoku Mathematical Journal , 43 , 355 – 386 ( 1937 ).
   Google Scholar
• Wendell , R. E. and Peterson , E. L. , “ A Dual Approach for Obtaining Lower Bounds to the Weber Problem ”, Journal of Regional Science , 24 , 219 – 228 ( 1984 ).
   Web of Science ®Google Scholar