On the theoretical properties of swap multimoves

  • Authors:
  • W. Boejko;M. Wodecki

  • Affiliations:
  • Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11-17, 50-372 Wrocław, Poland;Institute of Computer Science, University of Wrocław, Przesmyckiego 20, 51-151 Wrocław, Poland

  • Venue:
  • Operations Research Letters
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.