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.
- Version0.1-2
- R versionunknown
- LicenseGPL-3
- Needs compilation?Yes
- Last release06/27/2022
Documentation
Team
Michael Hahsler
MaintainerShow author detailsFranz Rendl
Show author detailsRolesContributor, Copyright holder
Insights
Last 30 days
This package has been downloaded 27,561 times in the last 30 days. The academic equivalent of having a dedicated subreddit. There are fans, and maybe even a few trolls! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 1,204 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 270,210 times in the last 365 days. Practically an academic rockstar! That's enough downloads to cause murmurs at international conferences. The day with the most downloads was Mar 11, 2025 with 1,379 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Suggests1 package
- Reverse Imports1 package