Abstract
In Constraint Programming (CP) a portfolio solver combines a variety of difierent con- straint solvers for solving a given problem. This fairly recent approach enables to signifi- cantly 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.
| Original language | English |
|---|---|
| Journal | Theory and Practice of Logic Programming |
| Volume | 18 |
| Issue number | 1 |
| Pages (from-to) | 1-14 |
| Number of pages | 14 |
| ISSN | 1471-0684 |
| DOIs | |
| Publication status | Published - Jan 2018 |
| Externally published | Yes |