SUNNY-CP : a Sequential CP Portfolio Solver. 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.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Dantas, Augusto; Pozo, Aurora: On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem (2020)
- Wang, Wenxi; Søndergaard, Harald; Stuckey, Peter J.: Wombit: a portfolio bit-vector solver using word-level propagation (2019)
- Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo: SUNNY-CP and the MiniZinc challenge (2018)
- Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo: Why CP portfolio solvers are (under)utilized? issues and challenges (2015)