The MaxHS-eval13 solver is based on ideas presented in [1] and [2]. It utilizes a SAT solver and a MIP solver in a hybrid approach.  MaxHS-eval13 uses  minisat 2.0 and CPLEX 12.5 as the SAT and MIP solvers respectively.

The MaxHS-eval13 solver uses the following techniques. Eq-seeding [2] is used to initially add constraints to the MIP model. Thereafter, the SAT solver finds only core constraints, as in [1].  However, the number of cores given to the MIP model between invocations of CPLEX can now be greater than 1 (this technique will be described in a forthcoming paper).

[1]  Jessica Davies and Fahiem Bacchus. Solving MAXSAT by solving a sequence of simpler SAT instances. In the Proceedings of Principles and Practice of Constraint Programming (CP), pages 225–239, 2011.

[2] Jessica Davies and Fahiem Bacchus. Exploiting the power of MIPs solvers in MAXSAT. In the Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), 2013.