BranchGLM
Efficient Best Subset Selection for GLMs via Branch and Bound Algorithms
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'.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
3.0.1 |
rolling linux/jammy R-4.5 | BranchGLM_3.0.1.tar.gz |
746.9 KiB |
3.0.1 |
rolling linux/noble R-4.5 | BranchGLM_3.0.1.tar.gz |
754.8 KiB |
3.0.1 |
rolling source/ R- | BranchGLM_3.0.1.tar.gz |
337.4 KiB |
3.0.1 |
latest linux/jammy R-4.5 | BranchGLM_3.0.1.tar.gz |
746.9 KiB |
3.0.1 |
latest linux/noble R-4.5 | BranchGLM_3.0.1.tar.gz |
754.8 KiB |
3.0.1 |
latest source/ R- | BranchGLM_3.0.1.tar.gz |
337.4 KiB |
3.0.1 |
2026-04-26 source/ R- | BranchGLM_3.0.1.tar.gz |
337.4 KiB |
3.0.1 |
2026-04-23 source/ R- | BranchGLM_3.0.1.tar.gz |
337.4 KiB |
3.0.1 |
2026-04-09 windows/windows R-4.5 | BranchGLM_3.0.1.zip |
1.1 MiB |
3.0.1 |
2025-04-20 source/ R- | BranchGLM_3.0.1.tar.gz |
337.4 KiB |