A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
From MaRDI portal
Publication:2850727
zbMath1273.49018arXiv1203.3200MaRDI QIDQ2850727
Nguyen Dinh Hoang, Nguyen Mau Nam
Publication date: 30 September 2013
Full work available at URL: https://arxiv.org/abs/1203.3200
Fermat-Torricelli problemsmallest intersecting ball problemsmallest enclosing ball problemSylvester smallest enclosing circle problem
Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Methods involving semicontinuity and convergence; relaxation (49J45)
Related Items
Solving a continuous multifacility location problem by DC algorithms ⋮ On Newton's method for the Fermat-Weber location problem ⋮ Minimizing differences of convex functions with applications to facility location and clustering ⋮ Directional variational principles and applications to the existence study in optimization ⋮ Minsum location extended to gauges and to convex sets ⋮ Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls ⋮ Uniqueness of circumcenters in generalized Minkowski spaces ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ The minimal time function associated with a collection of sets
This page was built for publication: A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
