Empirical Analysis of the RC2 MaxSAT Algorithm

The Boolean satisfiability problem (SAT) and maximum satisfiability problem (MaxSAT) are among the most well-known combinatorial problems in today’s computer science. The algorithms for their solving also go hand-in-hand, in that most MaxSAT solvers employ SAT solvers as the so-called oracles. In the present paper we perform a computational study of the RC2 algorithm, which is among the best state-of-the-art algorithms for MaxSAT solving. We view it from the SAT oracle viewpoint and consider how the SAT oracle’s runtime is distributed among RC2 procedures and heuristics, and how this statistics differs depending on the SAT solver employed as an oracle. In addition to that we consider the two baseline MSE’18 configurations of RC2, analyze their performance and experiment with blending them together.