mwcsr

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 (doi:10.1016/j.cor.2017.05.015) mixed-integer programming (doi:10.1007/978-3-319-43681-4_17) and simulated annealing.

Last 30 days

Last 365 days

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.