Solving WCSP by Extraction of Minimal Unsatisfiable Cores

Add code
Apr 19, 2013
Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary
Figure 1 for Solving WCSP by Extraction of Minimal Unsatisfiable Cores
Figure 2 for Solving WCSP by Extraction of Minimal Unsatisfiable Cores
Figure 3 for Solving WCSP by Extraction of Minimal Unsatisfiable Cores
Figure 4 for Solving WCSP by Extraction of Minimal Unsatisfiable Cores

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

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.

View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon