Tree Network Location Problems With Minimum Separations

REFERENCES

• Chandrasekaran , R. and Daughety , A. “ Location on Tree Networks p-Ccnter and n-Dispersion Problems ,” Math. Opns. Res. 6 , 50 – 57 ( 1981 ).
   Web of Science ®Google Scholar
• Christofides , N. and Viola , P. “ The Optimum Location of Multi-Centers on a Graph ,” Opns. Res. Quart. 22 , 145 – 154 ( 1971 ).
   Google Scholar
• Church , R. L. and Garfinkel , R. S. “ Locating an Obnoxious Facility on a Network ,” Trans. Sci. 12 , 107 – 118 ( 1978 ).
   Google Scholar
• Dearing , P. M. , Francis , R. L. , and Lowe , T. J. “ Convex Location Problems on Tree Networks ,” Opns. Res. 24 , 628 – 642 ( 1976 ).
   Web of Science ®Google Scholar
• Francis , R. L. , Lowe , T. J. , andRatliff , H. D. “ Distance Constraints for Tree Network Multifacility Location Problems ,” Opns. Res. 26 , 570 – 596 ( 1978 ).
   Web of Science ®Google Scholar
• Hakimi , S. L. “ Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems ,” Opns. Res. 13 , 462475 ( 1965 ).
   Web of Science ®Google Scholar
• Halpern , J. “ Duality in the Cent-Dian of a Graph ,” Opns. Res. 28 , 722 – 735 ( 1980 ).
   Web of Science ®Google Scholar
• Handler , G. Y. and Mirchaiidani , P. B. Location on Networks , The MIT Press , Cambridge , Mass. , 1979 .
   Google Scholar
• Kariv , O. , and Hakimi , S. L. “ An Algorithmic Approach to Network Location Problems. I the p-Centers ,” SIAM J. Appl. Moth. 37 , 513 – 538 ( 1979 ).
   Web of Science ®Google Scholar
• Kariv , O. , and Hakimi , S. L. “ An Algorithmic Approach to Network Location Problems. II the p-Medians ,” SIAMJ. Appl. Math. 37 , 539 – 560 ( 1979 ).
   Web of Science ®Google Scholar
• Khumawala , B. M. “ An Efficient Algorithm for the p-Median Problem with Maximum Distance Constraints ,” Geographl. Anal. 5 , 309 – 321 ( 1974 ).
   Web of Science ®Google Scholar
• Lowe , T. J. “ Efficient Solutions in Multiobjective Tree Network Location Problems ,” Trans. Sci. 12 , 298 – 316 ( 1978 ).
   Google Scholar
• Minieka , E. “ Anticenters and Antirnedians of A Network ,” Networks 13 , 359 – 364 ( 1983 ).
   Web of Science ®Google Scholar
• Moon , I. D. “ Application of Graph Theory t o a Location Problem ,” presented at the Joint National Meeting of ORSA/TIMS , Atlanta , Ga. , November 1977 .
   Google Scholar
• Moon , I. D. and Chaudhry , S. S. “ An Analysis of Network Location Problems with Distance Constraints ,” Mgmt. Sci. 30 , 290 – 307 ( 1984 ).
   Web of Science ®Google Scholar
• Shier , D. R. “ A Min-Max Theorem for p-Center Problems on a Tree ,” Trans. Sci. 11 , 243 – 252 ( 1977 ).
   Google Scholar
• Tansel , B. C. , Francis , R. L. , and Lowe , T. J. “ Binding Inequalities fo r Tree Network Location Problems with Dsance Constraints ,” Trans. Sci. 14 , 107 – 124 ( 1980 ).
   Web of Science ®Google Scholar
• Tansel , B. C. , Francis , R. L. , and Lowe , T. J. “ Location on Networks A Survey ,” Mgmt. Sci. 29 , 482 – 511 ( 1983 ).
   Web of Science ®Google Scholar
• Ting , S. S. “ A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks ,” Trans. Sci. 18 . 76 – 84 ( 1984 ).
   Web of Science ®Google Scholar