The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building general SCSP solvers. This paper is part of a series in which incremental changes are made to a branch and bound (BnB) algorithm for solving SCSPs. The authors present two variants of a BnB algorithm: a backjumping algorithm and a forward checking algorithm. These algorithms are based on the maximal constraints algorithms of Freuder and Wallace, and it is shown that they perform better than the BnB algorithm on some problem instances
Reference:
Leenen, L and Ghose, A. 2008. Branch and bound algorithms to solve semiring constraint satisfaction problems. Tenth Pacific Rim International Conference on Artificial Intelligence (PRICAI-08), Hanoi, Vietnam, 15-19 December 2008, pp 6
Leenen, L., & Ghose, A. (2008). Branch and bound algorithms to solve semiring constraint satisfaction problems. Pacific Rim International Conference on Artificial Intelligence (PRICAI-08). http://hdl.handle.net/10204/3040
Leenen, L, and A Ghose. "Branch and bound algorithms to solve semiring constraint satisfaction problems." (2008): http://hdl.handle.net/10204/3040
Leenen L, Ghose A, Branch and bound algorithms to solve semiring constraint satisfaction problems; Pacific Rim International Conference on Artificial Intelligence (PRICAI-08); 2008. http://hdl.handle.net/10204/3040 .
