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

Roberto Amadini*, Maurizio Gabbrielli, Jacopo Mauro

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationLogic-Based Program Synthesis and Transformation - 25th International Symposium, LOPSTR 2015, Revised Selected Papers
EditorsMoreno Falaschi
Number of pages16
PublisherSpringer-Verlag London Ltd
Publication date1. Jan 2015
Pages349-364
ISBN (Print)9783319274355
DOIs
Publication statusPublished - 1. Jan 2015
Externally publishedYes
Event25th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2015 - Siena, Italy
Duration: 13. Jul 201515. Jul 2015

Conference

Conference25th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2015
Country/TerritoryItaly
CitySiena
Period13/07/201515/07/2015
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9527
ISSN0302-9743

Cite this