01130nas a2200217   4500000000100000000000100001008004100002260001200043653001600055653001500071653001500086100002000101700001700121700002400138245008900162856009900251300001000350490000600360520053200366022001400898       2016                            d  c06/201610aProgramming10aAlgorithms10aConstraint1 aRoberto Amadini1 aJacopo Mauro1 aMaurizio Gabbrielli00aAn Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems  uhttp://www.ijimai.org/journal/sites/default/files/files/2016/05/ijimai20163_7_12_pdf_13932.pdf  a81-860 v33 aIn the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s) of the portfolio for solving a new, unseen problem. In this work we reproduce, simulate, and evaluate the performance of different portfolio approaches on extensive benchmarks of Constraint Satisfaction Problems. Empirical results clearly show the benefits of portfolio solvers in terms of both solved instances and solving time.  a1989-1660