Why CP portfolio solvers are (under)utilized? Issues and challenges

Roberto Amadini*, Maurizio Gabbrielli, Jacopo Mauro

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelLogic-Based Program Synthesis and Transformation - 25th International Symposium, LOPSTR 2015, Revised Selected Papers
RedaktørerMoreno Falaschi
Antal sider16
ForlagSpringer-Verlag London Ltd
Publikationsdato1. jan. 2015
Sider349-364
ISBN (Trykt)9783319274355
DOI
StatusUdgivet - 1. jan. 2015
Udgivet eksterntJa
Begivenhed25th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2015 - Siena, Italien
Varighed: 13. jul. 201515. jul. 2015

Konference

Konference25th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2015
LandItalien
BySiena
Periode13/07/201515/07/2015
NavnLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vol/bind9527
ISSN0302-9743

Citationsformater