qap: Heuristics for the Quadratic Assignment Problem (QAP)
Implements heuristics for the Quadratic Assignment Problem (QAP). Although, the QAP was introduced as a combinatorial optimization problem for the facility location problem in operations research, it also has many applications in data analysis. The problem is NP-hard and the package implements a simulated annealing heuristic.
| Version: | 0.1-2 |
| Suggests: | testthat |
| Published: | 2022-06-27 |
| DOI: | 10.32614/CRAN.package.qap |
| Author: | Michael Hahsler 
[aut, cre, cph],
Franz Rendl [ctb, cph] |
| Maintainer: | Michael Hahsler <mhahsler at lyle.smu.edu> |
| BugReports: | https://github.com/mhahsler/qap/issues |
| License: | GPL-3 |
| URL: | https://github.com/mhahsler/qap |
| NeedsCompilation: | yes |
| Materials: | README, NEWS |
| In views: | Optimization |
| CRAN checks: | qap results |
Documentation:
| Reference manual: | qap.html , qap.pdf |
Downloads:
| Package source: | qap_0.1-2.tar.gz |
| Windows binaries: | r-devel: qap_0.1-2.zip, r-release: qap_0.1-2.zip, r-oldrel: qap_0.1-2.zip |
| macOS binaries: | r-release (arm64): qap_0.1-2.tgz, r-oldrel (arm64): qap_0.1-2.tgz, r-release (x86_64): qap_0.1-2.tgz, r-oldrel (x86_64): qap_0.1-2.tgz |
| Old sources: | qap archive |
Reverse dependencies:
| Reverse imports: | seriation |
Linking:
Please use the canonical form https://CRAN.R-project.org/package=qap to link to this page.