Portfolio Approaches for Constraint Optimization Problems

Within the Constraints Satisfiability Problems (CSP) context, a methodology that has proved to be particularly performant consists in using a portfolio of different constraint solvers. Nevertheless, comparatively few studies and investigations has 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.