Six heuristic algorithms for solving the K-minimum volume ellipsoid (K-MVE) problem
We propose six heuristic methods for finding an approximate solution to the following combinatorial problem: GivenN points in the n-dimensional space, find the minimum-size ellipsoid covering exactly N k of them, where k is much less than N. Various assumptions on the nature of the points and their amount are considered; the results of illustrative numerical experiments with the
algorithms are discussed.
CYBERNETICS AND PHYSICS, Vol. 9, No. 4. 2020, 198–205 https://doi.org/10.35470/2226-4116-2020-9-4-198-205