The weighted Euclidean one-center problem in \(\mathbb{R}^n\)

DOI10.1007/s10589-024-00599-zMaRDI QIDQ6624439

P. M. Dearing, Mark E. Cawood

Publication date: 25 October 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

nonlinear programmingmin-max locationminimum covering ballone-center location

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Solving semidefinite-quadratic-linear programs using SDPT3
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• An algorithm for the minimax Weber problem
• The weighted Euclidean 1-center problem
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
• A dual simplex-type algorithm for the smallest enclosing ball of balls
• Graph Implementations for Nonsmooth Convex Programs
• The Weighted Euclidean 1-Center Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Technical Note—Extension of the Elzinga-Hearn Algorithm to the Weighted Case
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)

This page was built for publication: The weighted Euclidean one-center problem in \(\mathbb{R}^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624439)