Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms R package BranchGLM version 3.0.1 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'. Software Depends: R (>= 3.3.0) Imports: Rcpp (>= 1.0.7), methods, stats, graphics LinkingTo: Rcpp, RcppArmadillo, BH Suggests: knitr, rmarkdown, testthat (>= 3.0.0) Jacob Seedorff <jacob-seedorff@uiowa.edu> Comprehensive R Archive Network (CRAN) Jacob Seedorff [aut, cre] Apache License (>= 2) 2024-09-28 application/tgz https://CRAN.R-project.org/package=BranchGLM doi:10.32614/CRAN.package.BranchGLM