An Empirical Evaluation of Portfolios Approaches for solving CSPs
Source: University of Bochum
Recent research in areas such as SAT solving and Integer Linear Programming has shown that the performances of a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. The authors report an empirical evaluation and comparison of portfolio approaches applied to Constraint Satisfaction Problems (CSPs). They compared models developed on top of o -the-shelf machine learning algorithms with respect to approaches used in the SAT field and adapted for CSPs, considering different portfolio sizes and using as evaluation metrics the number of solved problems and the time taken to solve them.