2000 character limit reached
Elementary Components of the Quadratic Assignment Problem (1109.4875v1)
Published 22 Sep 2011 in cs.DM
Abstract: 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.
Collections
Sign up for free to add this paper to one or more collections.
