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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Theory and Practice of Logic Programming |
Vol/bind | 18 |
Udgave nummer | 1 |
Sider (fra-til) | 1-14 |
Antal sider | 14 |
ISSN | 1471-0684 |
DOI | |
Status | Udgivet - jan. 2018 |
Udgivet eksternt | Ja |