Elementary Components of the Quadratic Assignment Problem

Details Elementary Components of the Quadratic Assignment Problem Elementary Components of the Quadratic Assignment Problem

2011-09-22

arxiv.org/abs/1109.4875v1

Computer Science

Discrete Mathematics

10 pages, 1 figure. An extended version of this paper was published in GECCO 2010

Scientific paper

10.1145/1830483.1830745

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.

Affiliated with

Also associated with

No associations

Rating

Elementary Components of the Quadratic Assignment Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Elementary Components of the Quadratic Assignment Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elementary Components of the Quadratic Assignment Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263509