An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms

DOI10.1007/BF02568512zbMath0887.90098OpenAlexW1533363798MaRDI QIDQ1367876

Blas Pelegrín, Lázaro Cánovas

Publication date: 6 May 1998

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568512

zbMATH Keywords

cluster analysislocation1-center

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Continuous location (90B85) Probabilistic methods, stochastic differential equations (65C99)

Related Items (2)

Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. ⋮ Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set

Cites Work

• A simple heuristic for the p-centre problem
• On the uniqueness of optimal solutions in continuous location theory
• A duality theorem for non-linear programming
• On minimax optimization problems
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Finding Groups in Data
• Properties of ordinary and weighted sums of order $p$ used for distance estimation
• Analytic Inequalities
• The Minimum Covering Sphere Problem

This page was built for publication: An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms