CHAMP: A multipass algorithm for Max Sat based on saver variables

Daniel Berend, Shahar Golan, Yochai Twitto

Research output: Contribution to journalArticlepeer-review


In this paper, we introduce the concept of saver variables in Max Sat and demonstrate their contribution to the performance of solvers for this problem. We present two types of saver variables: high-rank savers and consensual savers. We show how to incorporate them in various ways into an iterated algorithm, CHAMP, for Max Sat. We conduct an extensive empirical evaluation on two collections of instances — instances from a past Max Sat competition and random instances. It turns out that, by using savers, the number of unsatisfied clauses may be reduced by more than 70% in some families. Moreover, a refined version CHAMP+ of CHAMP improves the results even further. We show that by combining CHAMP+ with CCLS, a state-of-the-art solver, we obtain better solutions for many Max Sat instances.

Original languageEnglish
Article number100760
JournalDiscrete Optimization
StatePublished - 1 Feb 2023


  • Combinatorial optimization
  • Iterated algorithm
  • Local search
  • Maximum satisfiability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'CHAMP: A multipass algorithm for Max Sat based on saver variables'. Together they form a unique fingerprint.

Cite this