二次指派问题的初等分支
Elementary Components of the Quadratic Assignment Problem
摘要：
二次分配问题（QAP）是一个著名的NP难组合优化问题，是许多现实世界优化问题的核心。我们证明，QAP可以写为三个基本景观时，交换邻域的总和。我们提出了一个封闭的三个基本组成部分的公式，我们计算的自相关系数的界限。
英文摘要：
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP can be written as the sum of three elementary landscapes when the swap neighborhood is used. We present a closed formula for each of the three elementary components and we compute bounds for the autocorrelation coefficient.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
