English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/160010
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


An efficient solver for weighted Max-SAT

AuthorsAlsinet, Teresa; Manyà, Felip ; Planes, Jordi
KeywordsData structures
Weighted Branch and bound
Lower bound
Issue Date2008
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.
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
Show full item record
Review this work

Related articles:

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