2026-10-15T23:31:37Z https://data.mendeley.com/oai

oai:data.mendeley.com/d8hds82d6s.1 2020-11-23T08:51:58Z

Huang, Xiangyang Smallest Enclosing Ball Mendeley Data Library to find the smallest enclosing ball of points in three algorithms based on QR-decompostion implemented by Martin Kutz <kutz@math.fu-berlin.de>, Kaspar Fischer <kf@iaeth.ch>. 1. Shrinking algorithm in shrink() in "Seb-inl.h". Authors: Martin Kutz <kutz@math.fu-berlin.de>, Kaspar Fischer <kf@iaeth.ch> 2. Dual algorithm in dual() in "Seb-inl.h". a variant of Cavaleivro and Alizadeh, which checks one facet in line search. Authors: X.Y. Huang <hxy@cnu.edu.cn> 3. Hybrid algoritm in hybrid() in "Seb-inl.h". a dual algorithm that uses a shrinking method to solve subproblems. Authors: X.Y. Huang <hxy@cnu.edu.cn> Additionally, Cavaleivro and Alizadeh's algorithm is available in dual2(), which checks at most two facets in line search. Authors: X.Y. Huang <hxy@cnu.edu.cn> Combinatorial Optimization Convex Optimization Dataset doi:10.17632/d8hds82d6s.1 oai:data.mendeley.com/d8hds82d6s.1 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/d8hds82d6s 2020-11-23T08:51:58Z