A Value Ordering Heuristic for Weighted CSP

摘要

In this paper, we propose a new value ordering heuristic for weighted constraint satisfaction problems (WCSP) based on the quality of solutions. The H-quality of an assignment estimates its capacity at occurring in solutions of 'good' quality. Experiments