A lightweight addition to CP frameworks for improved local search

Constraint programming and local search are two well known optimization technologies. In recent years, methods for combining these two technologies have been put forward, one of which advocates the use of constraint programming for searching the local neighborhood of the current solution. We present algorithmic improvements to this technique, and demonstrate their benefit through computational experiments.