Implements heuristics for the Quadratic Assignment Problem (QAP). Currently only a simulated annealing heuristic is available.
| Version: | 0.1-1 |
| Suggests: | testthat |
| Published: | 2017-02-27 |
| 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 |
| NeedsCompilation: | yes |
| Materials: | README NEWS |
| In views: | Optimization |
| CRAN checks: | qap results |
| Reference manual: | qap.pdf |
| Package source: | qap_0.1-1.tar.gz |
| Windows binaries: | r-devel: qap_0.1-1.zip, r-release: qap_0.1-1.zip, r-oldrel: qap_0.1-1.zip |
| macOS binaries: | r-release (arm64): qap_0.1-1.tgz, r-oldrel (arm64): qap_0.1-1.tgz, r-release (x86_64): qap_0.1-1.tgz, r-oldrel (x86_64): qap_0.1-1.tgz |
| Old sources: | qap archive |
| Reverse imports: | seriation |
Please use the canonical form https://CRAN.R-project.org/package=qap to link to this page.