Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10459.1/57376
|
Título:
|
Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
|
|
Autor/a:
|
Planes Cid, Jordi
|
|
Notas:
|
We developed novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, which are variants of the algorithm of Borchers & Furman (BFA) [1]. We improved BFA by (i) defining a lower bound of better quality, and (ii) incorporating a new variable selection heuristic.
This Research was partially supported by the project CICYT TIC2001-1577 -C03-03 funded by the Spanish Ministerio de Ciencia y Tecnolog´ıa |
|
Derechos:
|
(c) Springer Verlag, 2003
info:eu-repo/semantics/restrictedAccess |
|
Tipo de documento:
|
article
publishedVersion |
|
Editor:
|
Springer Verlag
|
|
Compartir:
|
|
Documentos con el texto completo de este documento
Mostrar el registro completo del ítem
