Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Michael Hahsler [aut, cre, cph] (<https://orcid.org/0000-0003-2716-1405>), Franz Rendl [ctb, cph] |
| Maintainer | Michael Hahsler <mhahsler@lyle.smu.edu> |
| License | GPL-3 |
| Version | 0.1-2 |
| URL | https://github.com/mhahsler/qap |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the qap package in your browser
Any scripts or data that you put into this service are public.
