Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | 2015 Symposium on Applied Computing, SAC 2015 |
| Editors | Dongwan Shin |
| Number of pages | 7 |
| Publisher | Association for Computing Machinery / Special Interest Group on Programming Languages |
| Publication date | 13. Apr 2015 |
| Pages | 1861-1867 |
| ISBN (Electronic) | 9781450331968 |
| DOIs | |
| Publication status | Published - 13. Apr 2015 |
| Externally published | Yes |
| Event | 30th Annual ACM Symposium on Applied Computing, SAC 2015 - Salamanca, Spain Duration: 13. Apr 2015 → 17. Apr 2015 |
Conference
| Conference | 30th Annual ACM Symposium on Applied Computing, SAC 2015 |
|---|---|
| Country/Territory | Spain |
| City | Salamanca |
| Period | 13/04/2015 → 17/04/2015 |
| Sponsor | ACM Special Interest Group on Applied Computing (SIGAPP) |