Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/10459.1/57428
|
Títol:
|
A Max-SAT Solver with Lazy Data Structures
|
|
Autor/a:
|
Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi
|
|
Notes:
|
We present a new branch and bound algorithm for Max-SAT
which incorporates original lazy data structures, a new variable selection
heuristics and a lower bound of better quality. We provide experimental
evidence that our solver outperforms some of the best performing Max-
SAT solvers on a wide range of instances.
Research partially supported by projects TIC2003-00950 and TIC2001-1577-C03-03 funded by the Ministerio de Ciencia y Tecnolog´ıa. |
|
Matèries:
|
-Max-SAT
-Branch and bound
-Lower bound |
|
Drets:
|
(c) Springer Verlag, 2004
info:eu-repo/semantics/restrictedAccess |
|
Tipus de document:
|
article
publishedVersion |
|
Publicat per:
|
Springer Verlag
|
|
Compartir:
|
|
Text complet d'aquest document
Mostra el registre complet del document
