Source: r-cran-qap
Standards-Version: 4.7.4
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders:
 Andreas Tille <tille@debian.org>,
Section: gnu-r
Testsuite: autopkgtest-pkg-r
Build-Depends:
 debhelper-compat (= 14),
 dh-r,
 r-base-dev,
 r-pkg-team-core-architecture,
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-qap
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-qap.git
Homepage: https://cran.r-project.org/package=qap

Package: r-cran-qap
Architecture: any
Depends:
 ${R:Depends},
 ${shlibs:Depends},
 ${misc:Depends},
 r-pkg-team-core-architecture,
Recommends:
 ${R:Recommends},
Suggests:
 ${R:Suggests},
Description: Heuristics for the Quadratic Assignment Problem (QAP)
 Implements a simulated annealing heuristic for the Quadratic Assignment
 Problem (QAP). Originally formulated as a facility location problem
 in operations research, the QAP also has applications in data analysis.
 The problem is NP-hard.
