Sequential time splitting and bounds communication for a portfolio of optimization solvers

Roberto Amadini, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

5 Citations (Scopus)


Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving Constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for Constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate information in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that combines static and dynamic time splitting for solving a given COP. Empirical evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication20th International Conference, CP 2014 Lyon, France, September 8-12, 2014 Proceedings
EditorsBarry O’Sullivan
Place of PublicationCham Switzerland
Number of pages17
ISBN (Electronic)9783319104287
ISBN (Print)9783319104270
Publication statusPublished - 2014
Externally publishedYes
EventInternational Conference on Principles and Practice of Constraint Programming 2014 - Lyon, France
Duration: 8 Sept 201412 Sept 2014
Conference number: 20th

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference on Principles and Practice of Constraint Programming 2014
Abbreviated titleCP 2014
Internet address

Cite this