| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143180 | Operations Research Letters | 2007 | 5 Pages |
Abstract
We prove that any permutation can be transformed into any other permutation by the execution of at most two swap multimoves (i.e. the diameter of the neighborhood graph is 2). We also prove that it is NP-hard to search over such a neighborhood.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
W. Bożejko, M. Wodecki,