Portfolio Approaches for Constraint Optimization Problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Annals of Mathematics and Artificial Intelligence Année : 2016

Portfolio Approaches for Constraint Optimization Problems

Résumé

Within the Constraint Satisfaction Problems (CSP) context, a methodology that has proven to be particularly performant consists of using a portfolio of different constraint solvers. Nevertheless, comparatively few studies and investigations have been done in the world of Constraint Optimization Problems (COP). In this work, we provide a generalization to COP as well as an empirical evaluation of different state of the art existing CSP portfolio approaches properly adapted to deal with COP. The results obtained by measuring several evaluation metrics confirm the effectiveness of portfolios even in the optimization field, and could give rise to some interesting future research.
Fichier principal
Vignette du fichier
amai_2014.pdf (422.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01336686 , version 1 (23-06-2016)

Identifiants

  • HAL Id : hal-01336686 , version 1

Citer

Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro. Portfolio Approaches for Constraint Optimization Problems. Annals of Mathematics and Artificial Intelligence, 2016. ⟨hal-01336686⟩
202 Consultations
332 Téléchargements

Partager

Gmail Facebook X LinkedIn More