Reactive Local Search Techniques for the Maximum k-Conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)

this paper the performance of the Hamming-based Reactive Tabu Search algorithm (H-RTS) previously proposed for the Maximum Satisfiability problem is studied for the different Maximum k--Conjunctive Constraint Satisfaction problem. In addition, the use of non-oblivious functions recently proposed in the framework of approximation algorithms is investigate