Marta Cavaleiro

most citedA faster dual algorithm for the Euclidean minimum covering ball problem

5 citations · 9 across the 3 of their papers we have counts for

collaborators

3 papers

math.OC2018★ 4 cited

A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems

Marta Cavaleiro, Farid Alizadeh

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…

math.OC2017

A branch-and-bound algorithm for the minimum radius $k$ -enclosing ball problem

Marta Cavaleiro, Farid Alizadeh

The minimum $k$ -enclosing ball problem seeks the ball with smallest radius that contains at least~ $k$ of~ $m$ given points in a general $n$ -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 $R^{n}$ . Each iteration of their algorithm has a computational complexity of at l…

A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems

A branch-and-bound algorithm for the minimum radius k-enclosing ball problem

A faster dual algorithm for the Euclidean minimum covering ball problem

A branch-and-bound algorithm for the minimum radius $k$ -enclosing ball problem