Published 2016
| Version v1
Report
SUNNY-CP: a Portfolio Solver for Constraint Programming
Contributors
Others:
- Foundations of Component-based Ubiquitous Systems (FOCUS) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Dipartimento di Informatica - Scienza e Ingegneria [Bologna] (DISI) ; Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)-Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)
- Department of Computer Science and Engineering [Bologna] (DISI) ; Alma Mater Studiorum Università di Bologna [Bologna] (UNIBO)
- University of Oslo (UiO)
- Inria Sophia Antipolis
Description
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 last MiniZinc Challenge —the annual international competition for CP solvers— where it won a gold medal.
Additional details
Identifiers
- URL
- https://hal.inria.fr/hal-01336407
- URN
- urn:oai:HAL:hal-01336407v1
Origin repository
- Origin repository
- UNICA