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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1-2 |
2026-04-09 windows/windows R-4.5 | qap_0.1-2.zip |
517.3 KiB |