LMHS is a from-scratch re-implementation of the MaxHS algorithm of [1,2,3], 
with the addition of label reuse [4] to allow for more efficient preprocessing.

LMHS uses MiniSat 2.2 as the underlying SAT solver, CPLEX 12.6.0 to solve the
hitting set IP, and Coprocessor 2 for preprocessing.

LMHS-I and LMHS-C differ only in the nonoptimal hitting set strategy used,
which was chosen based on performance on the 2014 Max-SAT evaluation crafted 
and industrial WPMS benchmark sets.

[1] Davies, Jessica and Bacchus, Fahiem: 
Solving MAXSAT by solving a sequence of simpler SAT instances. In: Proc. CP 2011.
[2] Davies, Jessica and Bacchus, Fahiem: 
Exploiting the power of MIP solvers in MAXSAT. In: Proc. SAT 2013
[3] Davies, Jessica and Bacchus, Fahiem: Postponing Optimization to Speed 
Up MAXSAT Solving. In: Proc. CP 2013
[4] Berg, Jeremias, Saikko, Paul, and Järvisalo, Matti: 
Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT. In: Proc. IJCAI 2015.