Solving k-center problems involving sets based on optimization techniques

• Published in: Journal of global optimization Vol. 76; no. 1; pp. 189 - 209
• Main Authors: An, Nguyen Thai, Nam, Nguyen Mau, Qin, Xiaolong
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.01.2020; Springer; Springer Nature B.V
• Subjects: Algorithms; Computational geometry; Computer Science; Convexity; Economic models; Mathematical optimization; Mathematics; Mathematics and Statistics; Methods; Operations Research/Decision Theory; Optimization; Optimization techniques; Real Functions; Majorization-minimization principle; 49J53; center problem; Primary: 49J52; Multifacility location problem; Difference of convex functions; Secondary: 90C30

The continuous k -center problem aims at finding k balls with the smallest radius to cover a finite number of given points in R n . In this paper, we propose and study the following generalized version of the k -center problem: Given a finite number of nonempty closed convex sets in R n , find k bal...