qap

Heuristics for the Quadratic Assignment Problem (QAP)

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.

Tests Vignettes

Available Snapshots

This version of qap can be found in the following snapshots:

Dependencies

Suggests (1)
  • testthat
  • Version History