Conference Proceedings
SUNNY-CP: a Sequential CP Portfolio Solver
Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro, D Shin (ed.)
ASSOC COMPUTING MACHINERY | Published : 2015
Abstract
The Constraint Programming (CP) paradigm allows to model and solve Constraint Satisfaction/Optimization Problems (CSPs/COPs). A CP Portfolio Solver is a particular constraint solver that takes advantage of a portfolio of different CP solvers in order to solve a given problem by properly exploiting Algorithm Selection techniques. In this work we present sunny-cp: a CP portfolio for solving both CSPs and COPs that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.