Portfolio approaches for constraint optimization problems
R Amadini, M Gabbrielli, J Mauro
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Lecture Notes in Computer Science | Published : 2014
Within the Constraints Satisfaction Problems (CSP) context, a methodology that has proven to be particularly performant consists in 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. Experimental results confirm the effectiveness of portfolios even in the optimization field, and could give rise to some interesting future research. © 2014 Springer International Publishing.