A branch-and-bound method for the minimum k−enclosing ball problem

Document Type

Article

Publication Date

5-1-2022

Abstract

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.

Identifier

85125749415 (Scopus)

Publication Title

Operations Research Letters

External Full Text Location

https://doi.org/10.1016/j.orl.2022.02.007

ISSN

01676377

First Page

274

Last Page

280

Issue

3

Volume

50

This document is currently not available here.

Share

COinS