TY - GEN
T1 - Why CP portfolio solvers are (under)utilized? Issues and challenges
AU - Amadini, Roberto
AU - Gabbrielli, Maurizio
AU - Mauro, Jacopo
PY - 2015/1/1
Y1 - 2015/1/1
N2 - It is well recognized that a single, arbitrarily efficient solver can be significantly outperformed by a portfolio solver exploiting a combination of possibly slower on-average different solvers. Despite the success of portfolio solvers within the context of solving competitions, they are rarely used in practice. In this paper we give an overview of the main limitations that hinder the practical adoption and development of portfolio solvers within the Constraint Programming (CP) paradigm, discussing also possible ways to overcome them and potential extensions outside the CP field.
AB - It is well recognized that a single, arbitrarily efficient solver can be significantly outperformed by a portfolio solver exploiting a combination of possibly slower on-average different solvers. Despite the success of portfolio solvers within the context of solving competitions, they are rarely used in practice. In this paper we give an overview of the main limitations that hinder the practical adoption and development of portfolio solvers within the Constraint Programming (CP) paradigm, discussing also possible ways to overcome them and potential extensions outside the CP field.
U2 - 10.1007/978-3-319-27436-2_21
DO - 10.1007/978-3-319-27436-2_21
M3 - Article in proceedings
AN - SCOPUS:84952782472
SN - 9783319274355
T3 - Lecture Notes in Computer Science
SP - 349
EP - 364
BT - Logic-Based Program Synthesis and Transformation - 25th International Symposium, LOPSTR 2015, Revised Selected Papers
A2 - Falaschi, Moreno
PB - Springer
T2 - 25th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2015
Y2 - 13 July 2015 through 15 July 2015
ER -