A note on the m-center problem with rectilinear distances-Reference-Cited by-同舟云学术

A note on the m-center problem with rectilinear distances

Published:1988-04 Issue:1 Volume:35 Page:118-123
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Aneja Y.P.,Chandrasekaran R.,Nair K.P.K.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference15 articles.

1. On some minimax location problems using rectilinear distances;Dearing,1972

2. Location problems;Dearing;Operations Research letters,1985

3. The p-center problem—Heuristic and optimal algorithms;Drezner;Journal of the Operational Research Society,1984

4. Geometrical solutions for some minimax location problems;Elzinga;Transportation Science,1971

5. A geometrical solution procedure for a rectilinear distance minimax location problem;Francis;AIIE Transactions,1971

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Group homophily based facility location selection in geo-social networks;World Wide Web;2022-03-23

2. The 1-center problem in the plane with independent random weights;Computers & Operations Research;2008-03

3. Planar maximal covering location problem under block norm distance measure;Journal of the Operational Research Society;2007-06

4. Maximizing cover probability by using multivariate normal distributions;OR Spectrum;2005-01

5. A new assignment rule to improve seed points algorithms for the continuous k-center problem;European Journal of Operational Research;1998-01