dc.contributor.author
Planes Cid, Jordi
dc.date.accessioned
2024-12-05T22:27:05Z
dc.date.available
2024-12-05T22:27:05Z
dc.date.issued
2016-07-07T10:04:55Z
dc.date.issued
2025-01-01
dc.identifier
https://doi.org/10.1007/978-3-540-45193-8_115
dc.identifier
http://hdl.handle.net/10459.1/57376
dc.identifier.uri
http://hdl.handle.net/10459.1/57376
dc.description.abstract
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.
dc.description.abstract
This Research was partially supported by the project CICYT TIC2001-1577 -C03-03 funded by the Spanish Ministerio de Ciencia y Tecnolog´ıa
dc.publisher
Springer Verlag
dc.relation
info:eu-repo/grantAgreement/MICYT//TIC2001-1577-C03-03/ES/
dc.relation
Reproducció del document publicat a https://doi.org/10.1007/978-3-540-45193-8_115
dc.relation
Lecture Notes in Computer Science, 2003, vol. 2833, p. 991
dc.rights
(c) Springer Verlag, 2003
dc.rights
info:eu-repo/semantics/restrictedAccess
dc.title
Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
