A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems
arXiv:1812.01236 · doi:10.1007/s10589-021-00283-6
Abstract
We define the notion of infimum of a set of points with respect to the second order cone. This problem can be showed to be equivalent to the minimum ball containing a set of balls problem and to the maximum intersecting ball problem, as well as others. We present a dual algorithm which can be viewed as an extension of the simplex method to solve this problem.