Solving weighted Maximum Satisfiability with Branch and Bound and clause learning
[Data availability] The provided link contains the software involved in this paper, including the software and the instructions and necessary data to reproduce the experiments. Source code and input parameters (Original data)
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2025 |
| País: | España |
| Recursos: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/400280 |
| Acesso em linha: | http://hdl.handle.net/10261/400280 https://api.elsevier.com/content/abstract/scopus_id/105010678363 |
| Access Level: | acceso abierto |
| Palavra-chave: | Branch-and-Bound algorithm Clause learning Combinatorial optimization Weighted partial MaxSAT |
| Resumo: | [Data availability] The provided link contains the software involved in this paper, including the software and the instructions and necessary data to reproduce the experiments. Source code and input parameters (Original data) |
|---|