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) ) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) ) and simulated annealing.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.2 by Alexander Loboda, a month ago

Report a bug at

Browse source code at

Authors: 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)

Documentation:   PDF Manual  

MIT + file LICENSE license

Imports methods, igraph, Rcpp

Suggests knitr, rmarkdown, mathjaxr, testthat, BioNet, roxygen2, DLBCL

Linking to Rcpp

System requirements: C++11, Java (>=8)

See at CRAN