aboutsummaryrefslogtreecommitdiff
path: root/gnu
diff options
context:
space:
mode:
authorRicardo Wurmus <rekado@elephly.net>2018-02-06 10:52:16 +0100
committerRicardo Wurmus <rekado@elephly.net>2018-02-06 11:21:56 +0100
commitffb59bcef769e5a362dd232b5e21575504212f6d (patch)
treed1e46419d435aff63662bb78ef1cb6359a1c93e4 /gnu
parentf285346aeda1945fc14c3c4fb37c51dc1227af24 (diff)
downloadpatches-ffb59bcef769e5a362dd232b5e21575504212f6d.tar
patches-ffb59bcef769e5a362dd232b5e21575504212f6d.tar.gz
gnu: Add r-qap.
* gnu/packages/cran.scm (r-qap): New variable.
Diffstat (limited to 'gnu')
-rw-r--r--gnu/packages/cran.scm20
1 files changed, 20 insertions, 0 deletions
diff --git a/gnu/packages/cran.scm b/gnu/packages/cran.scm
index fe40cac617..7af471a251 100644
--- a/gnu/packages/cran.scm
+++ b/gnu/packages/cran.scm
@@ -1931,3 +1931,23 @@ timeout. It can also poll several processes at once.")
algorithms for the @dfn{traveling salesperson problem}(TSP) (also known as the
traveling salesman problem).")
(license license:gpl3)))
+
+(define-public r-qap
+ (package
+ (name "r-qap")
+ (version "0.1-1")
+ (source
+ (origin
+ (method url-fetch)
+ (uri (cran-uri "qap" version))
+ (sha256
+ (base32
+ "0d2d1ni1camixyi45lfy00f4pn3p063k7bsi8gj5scp6n15mdgb0"))))
+ (build-system r-build-system)
+ (native-inputs `(("gfortran" ,gfortran)))
+ (home-page "http://cran.r-project.org/web/packages/qap/")
+ (synopsis "Heuristics for the quadratic assignment problem (QAP)")
+ (description "This package implements heuristics for the @dfn{quadratic
+assignment problem} (QAP). Currently only a simulated annealing heuristic is
+available.")
+ (license license:gpl3)))