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.
Amadini, R., Gabbrielli, M., Mauro, J. (2018). SUNNY-CP and the minizinc challenge. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 18(1), 1-14 [10.1017/S1471068417000205].
SUNNY-CP and the minizinc challenge
Amadini, Roberto;Gabbrielli, Maurizio;
2018
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
tplp17.pdf
accesso aperto
Tipo:
Postprint
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione - Non commerciale - Non opere derivate (CCBYNCND)
Dimensione
536.7 kB
Formato
Adobe PDF
|
536.7 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
