On solving the planar k-centrum problem with Euclidean distances
This paper presents a solution procedure based on a gradient descent method for the k-centrum problem in the plane. The particular framework of this problem for the Euclidean norm leads to bisector lines whose analytical expressions are easy to handle. This allows us to develop different solution procedures which are tested on different problems and compared with existing procedures in the literature of Location Analysis. The computational analysis reports that our procedures provide better results than the existing ones for the k-centrum problem.
gradient descent method continuous location ordered median problem