Revision as of 07:12, 12 December 2020 edit Monkbot (talk \| contribs) Bots 3,695,952 edits m Task 18 (cosmetic): eval 2 templates: del empty params (1×); Tag: AWB ← Previous edit		Revision as of 16:30, 14 January 2021 edit undo Yobot (talk \| contribs) Bots 4,733,870 edits m →top: Fix REFPUNCT + other minor fixes Tag: AWB Next edit →
Line 1: {{short description\|combinatorial optimization problem}} The '''quadratic assignment problem''' ('''QAP''') is one of the fundamental [[combinatorial optimization]] problems in the branch of [[Optimization (mathematics)\|optimization]] or [[operations research]] in [[mathematics]], from the category of the [[facilities ___location]] problems first introduced by Koopmans and Beckmann.<ref>Koopmans TC, Beckmann M (1957). Assignment problems and the ___location of economic activities. Econometrica 25(1):53-76</ref>. The problem models the following real-life problem:

Quadratic assignment problem: Difference between revisions