Solving WCSP by Extraction of Minimal Unsatisfiable Cores

19 Apr 2013Christophe LecoutreNicolas ParisOlivier RousselSébastien Tabary

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... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.