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)
- Version0.1.8
- R version≥ 3.5
- LicenseMIT
- Licensefile LICENSE
- Needs compilation?Yes
- Last release03/02/2024
Documentation
Team
Alexander Loboda
Nikolay Poperechnyi
Show author detailsRolesAuthorEduardo Alvarez-Miranda
Show author detailsRolesAuthorMarkus Sinnl
Show author detailsRolesAuthorAlexey Sergushichev
Show author detailsRolesAuthorPaul Hosler Jr.
Show author detailsRolesCopyright holderwww.hamcrest.org
Show author detailsRolesCopyright holderBarak Naveh
Contributors
Show author detailsRolesCopyright holderThe Apache Software Foundation
Show author detailsRolesCopyright holder
Insights
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.
Data provided by CRAN
Binaries
Dependencies
- Depends1 package
- Imports3 packages
- Suggests7 packages
- Linking To1 package
- Reverse Imports1 package