1 paper
Aurélie Massart, Valentin Rombouts, Pierre Schaus
Every Constraint Programming (CP) solver exposes a library of constraints for solving combinatorial problems. In order to be useful, CP solvers need to be bug-free. Therefore the t…