BranchGLM: Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms
Jacob Seedorff · 2022
Performs efficient and scalable glm best subset selection using a novel implementation of a branch and bound algorithm. To speed up the model fitting process, a range of optimization methods are implemented in 'RcppArmadillo'. Parallel computation is available using 'OpenMP'.