Previous | 
Home
Section: New Software and Platforms
SUNNY-CP
Scientific Description
Within the Constraint Programming paradigm, a portfolio solver combines different constraint solvers in order to create a globally better solver. Sunny-cp is a parallel parallel portfolio solver capable of solving Constraint (Satisfaction/Optimization) Problems defined in the MiniZinc language. It essentially implements the SUNNY algorithm introduced in the team. Sunny-cp is built on top of state-of-the-art constraint solvers, including: Choco, Chuffed, CPX, G12/LazyFD, G12/FD, G12/Gurobi, G12/CBC, Gecode, HaifaCSP, iZplus, MinisatID, Opturion, OR-Tools
SUNNY-CP is a portfolio solver for solving both Constraint Satisfaction Problems and Constraint Optimization Problems. The goal of SUNNY-CP is to provide a flexible, configurable, and usable CP portfolio solver that can be set up and executed just like a regular individual CP solver.