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.

Version: 0.1.2
Depends: R (≥ 3.5)
Imports: methods, igraph, Rcpp
LinkingTo: Rcpp
Suggests: knitr, rmarkdown, mathjaxr, testthat, BioNet, roxygen2, DLBCL
Published: 2021-12-19
Author: 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), [cph] (Bundled hamcrest package), Barak Naveh and Contributors [cph] (Bundled JGraphT package), The Apache Software Foundation [cph] (Bundled Apache Commons Math package)
Maintainer: Alexander Loboda <aleks.loboda at>
License: MIT + file LICENSE
NeedsCompilation: yes
SystemRequirements: C++11, Java (>=8)
Materials: README
CRAN checks: mwcsr results


Reference manual: mwcsr.pdf
Vignettes: Using mwcsr package


Package source: mwcsr_0.1.2.tar.gz
Windows binaries: r-devel:, r-devel-UCRT:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): mwcsr_0.1.2.tgz, r-release (x86_64): mwcsr_0.1.2.tgz, r-oldrel: mwcsr_0.1.2.tgz
Old sources: mwcsr archive


Please use the canonical form to link to this page.