5 citations · 10 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.OC2017
A branch-and-bound algorithm for the minimum radius -enclosing ball problem
Marta Cavaleiro, Farid Alizadeh
The minimum -enclosing ball problem seeks the ball with smallest radius that contains at least~ of~ given points in a general -dimensional Euclidean space. This problem…
math.OC2017★ 5 cited
A faster dual algorithm for the Euclidean minimum covering ball problem
Marta Cavaleiro, Farid Alizadeh
Dearing and Zeck presented a dual algorithm for the problem of the minimum covering ball in . Each iteration of their algorithm has a computational complexity of at l…