A new assignment rule to improve seed points algorithms for the continuous k-center problem-Reference-Cited by-同舟云学术

A new assignment rule to improve seed points algorithms for the continuous k-center problem

Published:1998-01 Issue:2 Volume:104 Page:366-374
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pelegrín B.,Cánovas L.

Publisher

Elsevier BV

Subject

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

Reference17 articles.

1. A note on the m-center problem with rectilinear distances;Aneja;European Journal of Operational Research,1988

2. On the rectangular p-center problem;Drezner;Naval Research Logistics,1987

3. Rectilinear m-center problem;Ko;Naval Research Logistics,1990

4. Relaxation method for the solution of the minimax location-allocation problem in the Euclidean space;Chen;Naval Research Logistics,1987

5. The p-center problem: Heuristic and operational algorithms;Drezner;Journal of Operational Research Society,1984

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

1. A Novel Space Partitioning Algorithm to Improve Current Practices in Facility Placement;IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans;2012-09

2. Solving the constrained p-center problem using heuristic algorithms;Applied Soft Computing;2011-06

3. Solving the constrained coverage problem;Applied Soft Computing;2011-01

4. Center Problem;Facility Location;2009

5. A Genetic Algorithm for the Constrained Coverage Problem;Advances in Intelligent and Soft Computing;2009