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

This package has been downloaded 259 times in the last 30 days. Enough downloads to make a small wave in the niche community. The curiosity is spreading! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 7 times.

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

Last 365 days

This package has been downloaded 2,439 times in the last 365 days. Now we’re talking! This work is officially 'heard of in academic circles', just like those wild research papers on synthetic bananas. The day with the most downloads was Sep 11, 2024 with 66 downloads.

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