The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.

qap: 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.

Version: 0.1-3
Suggests: testthat
Published: 2026-10-01
DOI: 10.32614/CRAN.package.qap
Author: Michael Hahsler ORCID iD [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, https://michael.hahsler.net/qap/
NeedsCompilation: yes
Citation: qap citation info
Materials: README, NEWS
In views: Optimization
CRAN checks: qap results

Documentation:

Reference manual: qap.html , qap.pdf

Downloads:

Package source: qap_0.1-3.tar.gz
Windows binaries: r-devel: qap_0.1-2.zip, r-release: qap_0.1-2.zip, r-oldrel: qap_0.1-3.zip
macOS binaries: r-release (arm64): qap_0.1-3.tgz, r-oldrel (arm64): qap_0.1-3.tgz, r-release (x86_64): qap_0.1-3.tgz, r-oldrel (x86_64): qap_0.1-3.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.

These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.