Combining Clause Learning and Branch and Bound for MaxSAT - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Combining Clause Learning and Branch and Bound for MaxSAT


Branch and Bound (BnB) is a powerful technique that has been successfully used to solve many combinatorial optimization problems. However, MaxSAT is a notorious exception because BnB MaxSAT solvers perform poorly on many instances encoding interesting real-world and academic optimization problems. This has formed a prevailing opinion in the community stating that BnB is not so useful for MaxSAT, except for random and some special crafted instances. In fact, there has been no advance allowing to significantly speed up BnB MaxSAT solvers in the past few years, as illustrated by the absence of BnB solvers in the annual MaxSAT Evaluation since 2017. Our work aims to change this situation and proposes a new BnB MaxSAT solver, called MaxCDCL, by combining clause learning and an efficient bounding procedure. The experimental results show that, contrary to the prevailing opinion, BnB can be competitive for MaxSAT. MaxCDCL is ranked among the top 5 solvers of the 15 solvers that participated in the 2020 MaxSAT Evaluation, solving a number of instances that other solvers cannot solve. Furthermore, MaxCDCL, when combined with the best existing solvers, solves the highest number of instances of the MaxSAT Evaluations.


Fichier principal
Vignette du fichier
LIPIcs-CP-2021-38.pdf (907.25 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03409895 , version 1 (30-10-2021)





Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, et al.. Combining Clause Learning and Branch and Bound for MaxSAT. 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), 2021, Montpellier (Online), Best Paper Award, France. ⟨10.4230/LIPIcs.CP.2021.38⟩. ⟨hal-03409895⟩
118 View
53 Download



Gmail Facebook X LinkedIn More