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,537 times in the last 30 days. The downloads are officially high enough to crash an underfunded departmental server. Quite an accomplishment! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 1,090 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,395 times in the last 365 days. That's a whole lot of downloads. Somewhere, a librarian is trying to figure out why more bandwidth is needed. 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