qap (Q71559)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
Heuristics for the Quadratic Assignment Problem (QAP)
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | qap |
Heuristics for the Quadratic Assignment Problem (QAP) |
Statements
1 October 2026
0 references
Implements a simulated annealing heuristic for the Quadratic Assignment Problem (QAP). Originally formulated as a facility location problem in operations research, the QAP also has applications in data analysis. The problem is NP-hard.
0 references
