SUNNY-CP: A sequential cp portfolio solver

Roberto Amadini; Maurizio Gabbrielli; Jacopo Mauro

doi:10.1145/2695664.2695741

SUNNY-CP: A sequential cp portfolio solver

Roberto Amadini
, Maurizio Gabbrielli
, Jacopo Mauro

University of Bologna

Publikation: Kapitel i bog/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review

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.

Originalsprog	Engelsk
Titel	2015 Symposium on Applied Computing, SAC 2015
Redaktører	Dongwan Shin
Antal sider	7
Forlag	Association for Computing Machinery / Special Interest Group on Programming Languages
Publikationsdato	13. apr. 2015
Sider	1861-1867
ISBN (Elektronisk)	9781450331968
DOI	https://doi.org/10.1145/2695664.2695741
Status	Udgivet - 13. apr. 2015
Udgivet eksternt	Ja
Begivenhed	30th Annual ACM Symposium on Applied Computing, SAC 2015 - Salamanca, Spanien Varighed: 13. apr. 2015 → 17. apr. 2015

Konference

Konference	30th Annual ACM Symposium on Applied Computing, SAC 2015
Land/Område	Spanien
By	Salamanca
Periode	13/04/2015 → 17/04/2015

Dokumenter og links

10.1145/2695664.2695741

SDU link

Tjek adgangen til materialet i Syddansk Universitetsbiblioteks søgemaskine

Citationsformater

@inproceedings{0f26e9642c124bd6bfc242890cc4cb48,

title = "SUNNY-CP: A sequential cp portfolio solver",

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.",

author = "Roberto Amadini and Maurizio Gabbrielli and Jacopo Mauro",

year = "2015",

month = apr,

day = "13",

doi = "10.1145/2695664.2695741",

language = "English",

pages = "1861--1867",

editor = "Dongwan Shin",

booktitle = "2015 Symposium on Applied Computing, SAC 2015",

publisher = "Association for Computing Machinery / Special Interest Group on Programming Languages",

note = "30th Annual ACM Symposium on Applied Computing, SAC 2015 ; Conference date: 13-04-2015 Through 17-04-2015",

}

Amadini, R, Gabbrielli, M & Mauro, J 2015, SUNNY-CP: A sequential cp portfolio solver. i D Shin (red.), 2015 Symposium on Applied Computing, SAC 2015. Association for Computing Machinery / Special Interest Group on Programming Languages, s. 1861-1867, 30th Annual ACM Symposium on Applied Computing, SAC 2015, Salamanca, Spanien, 13/04/2015. https://doi.org/10.1145/2695664.2695741

SUNNY-CP: A sequential cp portfolio solver. / Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo.
2015 Symposium on Applied Computing, SAC 2015. red. / Dongwan Shin. Association for Computing Machinery / Special Interest Group on Programming Languages, 2015. s. 1861-1867.

Publikation: Kapitel i bog/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - SUNNY-CP

T2 - 30th Annual ACM Symposium on Applied Computing, SAC 2015

AU - Amadini, Roberto

AU - Gabbrielli, Maurizio

AU - Mauro, Jacopo

PY - 2015/4/13

Y1 - 2015/4/13

N2 - 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.

AB - 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.

U2 - 10.1145/2695664.2695741

DO - 10.1145/2695664.2695741

M3 - Article in proceedings

AN - SCOPUS:84949843391

SP - 1861

EP - 1867

BT - 2015 Symposium on Applied Computing, SAC 2015

A2 - Shin, Dongwan

PB - Association for Computing Machinery / Special Interest Group on Programming Languages

Y2 - 13 April 2015 through 17 April 2015

ER -

SUNNY-CP: A sequential cp portfolio solver

Abstract

Konference

Dokumenter og links

SDU link

Fingeraftryk

Citationsformater