mhahsler/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 |
|
|---|---|
| Maintainer | |
| License | GPL-3 |
| Version | 0.1-2.1 |
| URL | https://github.com/mhahsler/qap |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
