| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652652 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
Local search procedures are popular methods to solve combinatorial problems and neighborhood structures are the main part of those algorithms. This paper presents a new neighborhood for the Quadratic Assignment Problem. The proposed neighborhood is compared with the classical 2-exchange neighborhood.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
