A Data Structure Boosting The Performance of Local Search For CSP Solving

International audienceThis paper is concerned with local search techniques (LS) for solving CSPs (Constraint Satisfaction Problems). An e cient data structure is presented that allows the performance of LS to be boosted. Experimentations on benchmarks from the last international CSP competitions illustrate its very positive impact. It has been implemented in wcsp : an e cient open-ended and open-source local search platform for CSP that can accommodate various meta-heuristics