1 code implementation • 24 Dec 2019 • Florian Arnold, Ítalo Santana, Kenneth Sörensen, Thibaut Vidal
During the local search, each pattern is used to define one move in which 1) incompatible edges are disconnected, 2) the edges defined by the pattern are reconnected, and 3) the remaining solution fragments are optimally reconnected.