Solvers for Maximum Weight Connected Subgraph Problem and Its Variants R package mwcsr version 0.1.12 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. Software Depends: R (>= 3.5) Imports: methods, igraph, Rcpp LinkingTo: Rcpp Suggests: knitr, rmarkdown, mathjaxr, testthat, BioNet, roxygen2, DLBCL Alexander Loboda <aleks.loboda@gmail.com> Comprehensive R Archive Network (CRAN) Alexander Loboda [aut, cre], Nikolay Poperechnyi [aut], Eduardo Alvarez-Miranda [aut], Markus Sinnl [aut], Alexey Sergushichev [aut], Paul Hosler Jr. [cph] (Bundled JOpt Simple package), www.hamcrest.org [cph] (Bundled hamcrest package), Barak Naveh and Contributors [cph] (Bundled JGraphT package), The Apache Software Foundation [cph] (Bundled Apache Commons Math package) MIT + file LICENSE (https://CRAN.R-project.org/package=mwcsr/LICENSE) 2026-06-30 application/tgz https://CRAN.R-project.org/package=mwcsr doi:10.32614/CRAN.package.mwcsr