ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
André Abramé, Djamal Habet · Journal on Satisfiability Boolean Modeling and Computation · 2015
Branch and bound (BnB) solvers for Max-SAT count at each node of the search tree the number of disjoint inconsistent subsets to compute the lower bound. In the last ten years, important advances have been made regarding the lower bound computation. U