Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/133523COMPARTIR / EXPORTAR:
 SHARE
BASE
|
|
| Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
| Título: | MinSAT versus MaxSAT for Optimization Problems |
Autor: | Argelich, Josep; Li, Chu Min; Manyà, Felip CSIC ORCID ; Zhu, Zhu | Palabras clave: | Empirical investigation Problem solving Constraint theory Computer programming Optimization problems Min-SAT Combinatorial problem Encodings Max-SAT |
Fecha de publicación: | 16-sep-2013 | Editor: | Springer Nature | Citación: | Lecture Notes in Computer Science 8124. Principles and Practice of Constraint Programming, 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, pp. 133-142. | Resumen: | Despite their similarities, MaxSAT and MinSAT use different encodings and solving techniques to cope with optimization problems. In this paper we describe a new weighted partial MinSAT solver, define original MinSAT encodings for relevant combinatorial problems, propose a new testbed for evaluating MinSAT, report on an empirical investigation comparing MinSAT with MaxSAT, and provide new insights into the duality between MinSAT and MaxSAT. © 2013 Springer-Verlag. | URI: | http://hdl.handle.net/10261/133523 | DOI: | 10.1007/978-3-642-40627-0_13 | Identificadores: | doi: 10.1007/978-3-642-40627-0_13 isbn: 978-3-642-40626-3 |
| Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| accesoRestringido.pdf | 15,38 kB | Adobe PDF |  Visualizar/Abrir |
CORE Recommender
Page view(s)
221
checked on 18-abr-2024
Download(s)
138
checked on 18-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.