Finding an Euclidean anti-\(k\)-centrum location of a set of points
type: Item
instance of: scholarly article
title: Finding an Euclidean anti-\(k\)-centrum location of a set of points
zbMATH Open document ID: 1175.90265
author: Antonio Lozano
author: Juan A. Mesa
author: Frank Plastria
published in: Computers \& Operations Research
publication date: 2009-10-15T00:00:00Z
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 5615437
zbMATH Keywords: continuous location
zbMATH Keywords: Euclidean distance
zbMATH Keywords: obnoxious facility
zbMATH Keywords: anti-\(k\)-centrum
MaRDI profile type: Publication
full work available at URL: j.cor.2009.05.001
OpenAlex ID: W2052007161
cites work: Properties of thek-centra in a tree network
cites work: Power Diagrams: Properties, Algorithms and Applications
cites work: Q4945505
cites work: OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
cites work: An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem
cites work: Algorithmic results for ordered median problems
cites work: Q2783025
cites work: Location of an undesirable facility in a polygonal region with forbidden zones
cites work: Location Theory
cites work: Minimizing the sum of the \(k\) largest functions in linear time.
cites work: Q4361347
cites work: Q3992847
cites work: A general model for the undesirable single facility location problem
cites work: Centers to centroids in graphs
cites work: The \(k\)-centrum multi-facility location problem
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
DOI: 10.1016/J.COR.2009.05.001
description: scientific article; zbMATH DE number 5615437