Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186)

The authors study the following generalized version of the \(k\)-center problem from both theoretical and numerical viewpoints: Given a finite number of nonempty closed convex sets in \(\mathbb{R}^n\), find \(k\) balls with the smallest radius such that their union intersects all of the sets. They particularly develop a numerical algorithms for solving them using a heuristic method and a new method based on the DCA, an algorithm for minimizing differences of convex functions. The effectiveness of these algorithms is proved via numerical examples at the end of the paper.