\textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
From MaRDI portal
Publication:5015607
Recommendations
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- A linear-time transformation of linear inequalities into conjunctive normal form
- Boolean lexicographic optimization: algorithms \& applications
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Hierarchical clustering schemes
- LMHS: a SAT-IP hybrid MaxSat solver
- Open-WBO: a modular MaxSAT solver
- PySAT: a Python toolkit for prototyping with SAT oracles
- QMaxSAT: A partial Max-SAT solver
- Solving MaxSAT with bit-vector optimization
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
Cited in
(3)
This page was built for publication: \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015607)