DMCA
Exploiting the power of MIP solvers in Maxsat (2013)
| Venue: | In Proc. SAT, volume 7962 of LNCS |
| Citations: | 7 - 1 self |
BibTeX
@INPROCEEDINGS{Davies13exploitingthe,
author = {Jessica Davies and Fahiem Bacchus},
title = {Exploiting the power of MIP solvers in Maxsat},
booktitle = {In Proc. SAT, volume 7962 of LNCS},
year = {2013},
pages = {166--181},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. maxsat is an optimization version of satisfiability. Since many practical problems involve optimization, there are a wide range of potential applications for effective maxsat solvers. In this paper we present an extensive empirical evaluation of a number of maxsat solvers. In addition to traditional maxsat solvers, we also evaluate the use of a state-of-the-art Mixed Integer Program (mip) solver, cplex, for solving maxsat. mip solvers are the most popular technology for solving opti-mization problems and are also theoretically more powerful than sat solvers. In fact, we show that cplex is quite effective on a range of maxsat instances. Based on these observations we extend a previously developed hybrid approach for solving maxsat, that utilizes both a sat solver and a mip solver. Our extensions aim to take better advantage of the power of the mip solver. The resulting improved hybrid solver is shown to be quite effective. 1
Keyphrases
mip solver sat solver maxsat solver traditional maxsat solver optimization version improved hybrid solver extensive empirical evaluation wide range popular technology state-of-the-art mixed integer program effective maxsat solver potential application opti-mization problem hybrid approach many practical problem maxsat instance
