cran.rstudio.com/web/packages/mwcsr/index.html
Preview meta tags from the cran.rstudio.com website.
Linked Hostnames
4Thumbnail
Search Engine Appearance
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) <<a href="https://doi.org/10.1016%2Fj.cor.2017.05.015" target="_top">doi:10.1016/j.cor.2017.05.015</a>>) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <<a href="https://doi.org/10.1007%2F978-3-319-43681-4_17" target="_top">doi:10.1007/978-3-319-43681-4_17</a>>) and simulated annealing.
Bing
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) <<a href="https://doi.org/10.1016%2Fj.cor.2017.05.015" target="_top">doi:10.1016/j.cor.2017.05.015</a>>) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <<a href="https://doi.org/10.1007%2F978-3-319-43681-4_17" target="_top">doi:10.1007/978-3-319-43681-4_17</a>>) and simulated annealing.
DuckDuckGo
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) <<a href="https://doi.org/10.1016%2Fj.cor.2017.05.015" target="_top">doi:10.1016/j.cor.2017.05.015</a>>) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <<a href="https://doi.org/10.1007%2F978-3-319-43681-4_17" target="_top">doi:10.1007/978-3-319-43681-4_17</a>>) and simulated annealing.
General Meta Tags
13- titleCRAN: Package mwcsr
- Content-Typetext/html; charset=utf-8
- viewportwidth=device-width, initial-scale=1.0, user-scalable=yes
- citation_titleSolvers for Maximum Weight Connected Subgraph Problem and Its Variants [R package mwcsr version 0.1.9]
- citation_author1Alexander Loboda
Open Graph Meta Tags
5- og:titlemwcsr: Solvers for Maximum Weight Connected Subgraph Problem and Its Variants
- og:descriptionAlgorithms 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) <<a href="https://doi.org/10.1016%2Fj.cor.2017.05.015" target="_top">doi:10.1016/j.cor.2017.05.015</a>>) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <<a href="https://doi.org/10.1007%2F978-3-319-43681-4_17" target="_top">doi:10.1007/978-3-319-43681-4_17</a>>) and simulated annealing.
- og:imagehttps://CRAN.R-project.org/CRANlogo.png
- og:typewebsite
- og:urlhttps://CRAN.R-project.org/package=mwcsr
Twitter Meta Tags
1- twitter:cardsummary
Link Tags
2- canonicalhttps://CRAN.R-project.org/package=mwcsr
- stylesheet../../CRAN_web.css
Links
10- https://CRAN.R-project.org/package=mwcsr
- https://CRAN.R-project.org/src/contrib/Archive/mwcsr
- https://doi.org/10.1007%2F978-3-319-43681-4_17
- https://doi.org/10.1016%2Fj.cor.2017.05.015
- https://doi.org/10.32614/CRAN.package.mwcsr