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.
https://hal.inria.fr/hal-01227589
Contributor : Amadini Roberto <>
Submitted on : Monday, November 23, 2015 - 5:28:50 PM Last modification on : Friday, October 30, 2020 - 12:04:03 PM Long-term archiving on: : Wednesday, February 24, 2016 - 10:21:01 AM