Show simple item record

dc.contributor.authorAlsinet, Teresa
dc.contributor.authorManyà Serres, Felip
dc.contributor.authorPlanes Cid, Jordi
dc.date.accessioned2016-07-11T12:37:11Z
dc.date.issued2004
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10459.1/57428
dc.description.abstractWe 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.ca_ES
dc.description.sponsorshipResearch partially supported by projects TIC2003-00950 and TIC2001-1577-C03-03 funded by the Ministerio de Ciencia y Tecnolog´ıa.ca_ES
dc.language.isoengca_ES
dc.publisherSpringer Verlagca_ES
dc.relationMICYT/PN2000-2003/TIC2003-00950ca_ES
dc.relationMICYT/PN2000-2003/TIC2001-1577-C03-03ca_ES
dc.relation.isformatofReproducció del document publicat a https://doi.org/10.1007/978-3-540-30498-2_34ca_ES
dc.relation.ispartofLecture Notes in Computer Science, 2004, vol. 3315, p. 334-342ca_ES
dc.rights(c) Springer Verlag, 2004ca_ES
dc.subjectMax-SATca_ES
dc.subjectBranch and boundca_ES
dc.subjectLower boundca_ES
dc.titleA Max-SAT Solver with Lazy Data Structuresca_ES
dc.typearticleca_ES
dc.identifier.idgrec006637
dc.type.versionpublishedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_ES
dc.identifier.doihttps://doi.org/10.1007/978-3-540-30498-2_34
dc.date.embargoEndDate2025-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record