Solving weighted maximum satisfiability with branch and bound and clause learning
From MaRDI portal
Cites work
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Abstract cores in implicit hitting set MaxSat solving
- Algorithms for Weighted Boolean Optimization
- An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
- Boolean lexicographic optimization: algorithms \& applications
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Certified dominance and symmetry breaking for combinatorial optimisation
- Clause vivification by unit propagation in CDCL SAT solvers
- Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
- Exact MinSAT Solving
- Exploiting the power of MIP solvers in MAXSAT
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Incremental Upper Bound for the Maximum Clique Problem
- LMHS: a SAT-IP hybrid MaxSat solver
- Minimaxsat: an efficient weighted Max-SAT solver
- New inference rules for Max-SAT
- Open-WBO: a modular MaxSAT solver
- QMaxSAT: A partial Max-SAT solver
- RC2: an efficient MaxSAT solver
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- SAT-based MaxSAT algorithms
- Shift Design with Answer Set Programming
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving the Team Composition Problem in a Classroom
- Speeding up pseudo-Boolean propagation
- The complexity of theorem-proving procedures
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Understanding the power of Max-SAT resolution through up-resilience
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
This page was built for publication: Solving weighted maximum satisfiability with branch and bound and clause learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891347)
