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 ORCID iD [aut, cre, cph], Franz Rendl [ctb, cph]
Maintainer: Michael Hahsler <mhahsler at>
License: GPL-3
NeedsCompilation: yes
Materials: README NEWS
In views: Optimization
CRAN checks: qap results


Reference manual: qap.pdf


Package source: qap_0.1-2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
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


Please use the canonical form to link to this page.