A branch-and-bound method for the minimum \(k\)-enclosing ball problem

DOI10.1016/j.orl.2022.02.007OpenAlexW4213046947MaRDI QIDQ2157894

Marta Cavaleiro, Farid Alizadeh

Publication date: 22 July 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2022.02.007

zbMATH Keywords

branch-and-boundminimum enclosing ball1-center with outlierssmallest covering ball

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On enclosing k points by a circle
• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• Efficient algorithms for the smallest enclosing ball problem
• QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
• Net and Prune
• Two Algorithms for the Minimum Enclosing Ball Problem
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Static and Dynamic Algorithms for k-Point Clustering Problems
• Computing the smallest k-enclosing circle and related problems
• The problem of a minimal ball enclosing k points
• An efficient, exact, and generic quadratic programming solver for geometric optimization
• Approximate minimum enclosing balls in high dimensions using core-sets
• Robust shape fitting via peeling and grating coresets

This page was built for publication: A branch-and-bound method for the minimum \(k\)-enclosing ball problem