![]()
![]()
出典:Wikipedia
出典:『Wikipedia』 (2011/04/15 16:51 UTC 版)
The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.