An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
type: Item
instance of: scholarly article
title: An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
zbMATH Open document ID: 0887.90098
DOI: 10.1007/BF02568512
published in: Top
publication date: 1998-05-06T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 65C99
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1069844
zbMATH Keywords: location
zbMATH Keywords: 1-center
zbMATH Keywords: cluster analysis
author: B. Pelegrin
author: Lázaro Cánovas
MaRDI profile type: Publication
cites work: Properties of ordinary and weighted sums of order $p$ used for distance estimation
cites work: On minimax optimization problems
cites work: A simple heuristic for the p-centre problem
cites work: The Minimum Covering Sphere Problem
cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem
cites work: Finding Groups in Data
cites work: Analytic Inequalities
cites work: On the uniqueness of optimal solutions in continuous location theory
cites work: A duality theorem for non-linear programming
full work available at URL: https://doi.org/10.1007/bf02568512
OpenAlex ID: W1533363798
Recommended article: On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
Recommended article: Q3989472
Recommended article: Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints
Recommended article: Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints
Recommended article: An algorithm and a core set result for the weighted Euclidean one-center problem
Recommended article: An algorithmic approach to the center problem for homogeneous perturbations
Recommended article: An optimal generalization of the centerpoint theorem, and its extensions
Recommended article: The (1|1)-Centroid Problem in the Plane with Distance Constraints
Recommended article: Linear Time Algorithm for 1-Center in $$\mathfrak {R}^d$$ Under Convex Polyhedral Distance Function
Recommended article: Solving the discrete \(l_p\)-approximation problem by a method of centers
description: scientific article; zbMATH DE number 1069844