A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Conventional ways of using local search are di cult to generalize. Increased e ciency is the only goal, generality often being disregarded. This is manifested in the highly monolithic encodings of complex problems and the application of highly speci c satisfaction methods. Other approaches take the general constraint programming framework as a starting point and try to introduce local search methods for constraint satisfaction. These methods frequently fail because they have only a very limiteddoi:10.1007/3-540-45746-1_2 fatcat:e2nl2si56ffxbi4snbxv7vrtoq