Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160010
Share/Export:
logo share SHARE logo core CORE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Title

An efficient solver for weighted Max-SAT

AuthorsAlsinet, Teresa; Manyà, Felip CSIC ORCID ; Planes, Jordi
KeywordsData structures
Heuristics
Max-SAT
Weighted Branch and bound
Lower bound
Issue Date2008
PublisherSpringer
CitationJournal of Global Optimization 41: 61- 73 (2008)
AbstractWe 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. © 2007 Springer Science+Business Media LLC.
URIhttp://hdl.handle.net/10261/160010
DOI10.1007/s10898-007-9166-9
Identifiersdoi: 10.1007/s10898-007-9166-9
issn: 0925-5001
Appears in Collections:(IIIA) Artículos




Files in This Item:
File Description SizeFormat
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work

SCOPUSTM   
Citations

15
checked on May 24, 2022

WEB OF SCIENCETM
Citations

9
checked on May 20, 2022

Page view(s)

210
checked on May 25, 2022

Download(s)

73
checked on May 25, 2022

Google ScholarTM

Check

Altmetric

Dimensions


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.