An efficient solver for weighted Max-SAT
| Data(s) |
2008
|
|---|---|
| Resumo |
We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence that our solver is very competitive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers on a wide range of instances. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Relação |
Versió postprint del document publicat a: http://dx.doi.org/10.1007/s10898-007-9166-9 Journal of Global Optimization, 2008, vol. 41, núm. 1, pàg. 61-73 |
| Direitos |
info:eu-repo/semantics/openAccess (c) Springer, (2008) |
| Palavras-Chave | #Max-SAT #WeightedMax-SAT #Branch and bound #Lower bound #Heuristics #Data structures #Heurística #Algorismes |
| Tipo |
article |
