Solving WCSP by Extraction of Minimal Unsatisfiable Cores

04/19/2013
by   Christophe Lecoutre, et al.
0

Usual techniques to solve WCSP are based on cost transfer operations coupled with a branch and bound algorithm. In this paper, we focus on an approach integrating extraction and relaxation of Minimal Unsatisfiable Cores in order to solve this problem. We decline our approach in two ways: an incomplete, greedy, algorithm and a complete one.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset