@inproceedings{SaikkoBJ:SAT2016,
author = {Paul Saikko and Jeremias Berg and Matti J\"arvisalo},
title = {{LMHS}: A {SAT-IP} Hybrid {MaxSAT} Solver},
editor = {Nadia Creignou and Daniel Le Berre}, 
booktitle = {Proceedings of the 19th International Conference on 
    Theory and Applications of Satisfiability Testing (SAT 2016)},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {9710},
pages = {539--546},
year = {2016},
}

Abstract:

We describe LMHS, an open-source weighted partial maximum satisfiability 
(MaxSAT) solver.  LMHS is a hybrid SAT-IP MaxSAT solver that implements the 
implicit hitting set approach to MaxSAT. On top of the main algorithm, 
LMHS offers integrated preprocessing, solution enumeration, an incremental 
API, and the use of a choice of SAT and IP solvers. We describe the main 
features of LMHS, and give empirical results on the influence of preprocessing 
and the choice of the underlying SAT and IP solvers on the performance 
of LMHS.