dc.contributor.author |
Alsinet, Teresa |
dc.contributor.author |
Manyà Serres, Felip |
dc.contributor.author |
Planes Cid, Jordi |
dc.date |
2013-09-10T08:22:37Z |
dc.date |
2013-09-10T08:22:37Z |
dc.date |
2008 |
dc.identifier |
0925-5001 |
dc.identifier |
http://hdl.handle.net/10459.1/46634 |
dc.identifier |
https://doi.org/10.1007/s10898-007-9166-9 |
dc.identifier.uri |
http://hdl.handle.net/10459.1/46634 |
dc.description |
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. |
dc.language |
eng |
dc.publisher |
Springer |
dc.relation |
Versió postprint del document publicat a: https://doi.org/10.1007/s10898-007-9166-9 |
dc.relation |
Journal of Global Optimization, 2008, vol. 41, núm. 1, pàg. 61-73 |
dc.rights |
(c) Springer, 2008 |
dc.rights |
info:eu-repo/semantics/openAccess |
dc.subject |
Max-SAT |
dc.subject |
WeightedMax-SAT |
dc.subject |
Branch and bound |
dc.subject |
Lower bound |
dc.subject |
Heuristics |
dc.subject |
Data structures |
dc.subject |
Heurística |
dc.subject |
Algorismes |
dc.title |
An efficient solver for weighted Max-SAT |
dc.type |
article |
dc.type |
acceptedVersion |