Quadratic Assignment Problem

When the user wants to model or solve the quadratic assignment problem — assigning n facilities to n locations to minimize the total flow-times-distance cost — with linearized MIP models or robust tabu search built on O(n) swap delta evaluation. Also use when the user mentions "quadratic assignment," "QAP," "flow distance," "QAPLIB," "facility layout," or "Koopmans-Beckmann," or when pairwise interaction costs depend on a permutation. For linear assignment without interaction terms, see assignment-problems; for choosing among product linearizations, see linearization-techniques.

hajibabaie Updated 18 repo stars

File contents

hajibabaie/combinatorial-optimization-skills commit 868c7d1f81

Frequently asked questions

npx get-skill add hajibabaie/quadratic-assignment-problem