mwcsr
Solvers for Maximum Weight Connected Subgraph Problem and Its Variants
Algorithms for solving various Maximum Weight Connected Subgraph Problems, including variants with budget constraints, cardinality constraints, weighted edges and signals. The package represents an R interface to high-efficient solvers based on relax-and-cut approach (Álvarez-Miranda E., Sinnl M. (2017) <doi:10.1016/j.cor.2017.05.015>) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <doi:10.1007/978-3-319-43681-4_17>) and simulated annealing.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.10 |
rolling linux/jammy R-4.5 | mwcsr_0.1.10.tar.gz |
2.7 MiB |
0.1.10 |
rolling linux/noble R-4.5 | mwcsr_0.1.10.tar.gz |
2.7 MiB |
0.1.10 |
rolling source/ R- | mwcsr_0.1.10.tar.gz |
2.5 MiB |
0.1.10 |
latest linux/jammy R-4.5 | mwcsr_0.1.10.tar.gz |
2.7 MiB |
0.1.10 |
latest linux/noble R-4.5 | mwcsr_0.1.10.tar.gz |
2.7 MiB |
0.1.10 |
latest source/ R- | mwcsr_0.1.10.tar.gz |
2.5 MiB |
0.1.10 |
2026-04-26 source/ R- | mwcsr_0.1.10.tar.gz |
2.5 MiB |
0.1.10 |
2026-04-23 source/ R- | mwcsr_0.1.10.tar.gz |
2.5 MiB |
0.1.10 |
2026-04-09 windows/windows R-4.5 | mwcsr_0.1.10.zip |
3.0 MiB |
0.1.9 |
2025-04-20 source/ R- | mwcsr_0.1.9.tar.gz |
2.5 MiB |