Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers

Abstract : 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 informa-tion in the form of bounds to improve the performance of the following solvers. We provide a hybrid and flexible portfolio approach that com-bines static and dynamic time splitting for solving a given COP. Empiri-cal evaluations show the approach is promising and sometimes even able to outperform the best solver of the porfolio.
Type de document :
Communication dans un congrès
Principles and Practice of Constraint Programming (CP 2014), Sep 2014, Lyon, France. pp.108 - 124, 2014, 〈10.1007/978-3-319-10428-7_11〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01091664
Contributeur : Amadini Roberto <>
Soumis le : lundi 8 décembre 2014 - 21:47:34
Dernière modification le : samedi 27 janvier 2018 - 01:30:55
Document(s) archivé(s) le : lundi 9 mars 2015 - 10:15:43

Fichier

timesplit.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Roberto Amadini, Peter J. Stuckey. Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers. Principles and Practice of Constraint Programming (CP 2014), Sep 2014, Lyon, France. pp.108 - 124, 2014, 〈10.1007/978-3-319-10428-7_11〉. 〈hal-01091664〉

Partager

Métriques

Consultations de la notice

143

Téléchargements de fichiers

80