Finding an Euclidean anti-\(k\)-centrum location of a set of points

DOI10.1016/J.COR.2009.05.001zbMath1175.90265OpenAlexW2052007161MaRDI QIDQ732894

Frank Plastria, Antonio J. Lozano, Juan A. Mesa

Publication date: 15 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.001

zbMATH Keywords

continuous locationEuclidean distanceobnoxious facilityanti-\(k\)-centrum

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (4)

Extensions to the Weber problem ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Location of an undesirable facility in a polygonal region with forbidden zones
• Minimizing the sum of the \(k\) largest functions in linear time.
• Algorithmic results for ordered median problems
• A general model for the undesirable single facility location problem
• Location Theory
• Properties of thek-centra in a tree network
• An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
• Centers to centroids in graphs
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Power Diagrams: Properties, Algorithms and Applications
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
• The \(k\)-centrum multi-facility location problem

This page was built for publication: Finding an Euclidean anti-\(k\)-centrum location of a set of points