Crandore Hub

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

VersionRepositoryFileSize
0.1-2 rolling linux/jammy R-4.5 qap_0.1-2.tar.gz 456.1 KiB
0.1-2 rolling linux/noble R-4.5 qap_0.1-2.tar.gz 456.1 KiB
0.1-2 rolling source/ R- qap_0.1-2.tar.gz 494.4 KiB
0.1-2 latest linux/jammy R-4.5 qap_0.1-2.tar.gz 456.1 KiB
0.1-2 latest linux/noble R-4.5 qap_0.1-2.tar.gz 456.1 KiB
0.1-2 latest source/ R- qap_0.1-2.tar.gz 494.4 KiB
0.1-2 2026-04-26 source/ R- qap_0.1-2.tar.gz 494.4 KiB
0.1-2 2026-04-23 source/ R- qap_0.1-2.tar.gz 494.4 KiB
0.1-2 2026-04-09 windows/windows R-4.5 qap_0.1-2.zip 517.3 KiB
0.1-2 2025-04-20 source/ R- qap_0.1-2.tar.gz 494.4 KiB

Dependencies (latest)

Suggests