-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathDESCRIPTION
42 lines (42 loc) · 1.83 KB
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
Package: mwcsr
Title: Solvers for Maximum Weight Connected Subgraph Problem and Its Variants
Version: 0.1.9
Authors@R: c(person("Alexander", "Loboda", email = "[email protected]", role = c("aut", "cre")),
person("Nikolay", "Poperechnyi", email = "[email protected]", role = "aut"),
person("Eduardo", "Alvarez-Miranda", email = "[email protected]", role = "aut"),
person("Markus", "Sinnl", email = "[email protected]", role = "aut"),
person("Alexey", "Sergushichev", email = "[email protected]", role = "aut"),
person("Paul", "Hosler Jr.", role = "cph", comment = "Bundled JOpt Simple package"),
person("www.hamcrest.org", role = "cph", comment = "Bundled hamcrest package"),
person("Barak Naveh and Contributors", role = "cph", comment = "Bundled JGraphT package"),
person("The Apache Software Foundation", role = "cph", comment = "Bundled Apache Commons Math package"))
Description: 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) <doi:10.1016/j.cor.2017.05.015>)
mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <doi:10.1007/978-3-319-43681-4_17>)
and simulated annealing.
Depends: R (>= 3.5)
Imports:
methods,
igraph,
Rcpp
Suggests:
knitr,
rmarkdown,
mathjaxr,
testthat,
BioNet,
roxygen2,
DLBCL
SystemRequirements: Java (>=8)
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.2.3
Roxygen: list(markdown = TRUE)
VignetteBuilder: knitr
URL: https://github.com/ctlab/mwcsr
BugReports: https://github.com/ctlab/mwcsr/issues
LinkingTo: Rcpp