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 245 times in the last 30 days. More than a random curiosity, but not quite a blockbuster. Still, it's gaining traction! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 11 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,428 times in the last 365 days. Consider this 'mid-tier influencer' status—if it were a TikTok, it would get a nod from nieces and nephews. 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.