SUNNY-CP and the MiniZinc Challenge
By
Roberto Amadini, Department of Computing and Information Systems, The University of Melbourne, Australia.
Maurizio Gabbrielli, DISI, University of Bologna, Italy / FOCUS Research Team, INRIA, France.
Jacopo Mauro, Department of Informatics, University of Oslo, Norway
Abstract
In Constraint Programming (CP) a portfolio solver combines a variety of different constraint solvers for solving a given problem. This fairly recent approach enables to significantly boost the performance of single solvers, especially when multicore architectures are exploited. In this work we give a brief overview of the portfolio solver sunny-cp, and we discuss its performance in the MiniZinc Challenge—the annual international competition for CP solvers—where it won two gold medals in 2015 and 2016.