Cited in
(48)- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Abstract cores in implicit hitting set MaxSat solving
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- A novel algorithm for Max Sat calling MOCE to order
- Improvements to core-guided binary search for MaxSAT
- Resizing cardinality constraints for MaxSAT
- OptSAT
- MaxSolver
- RPOLY
- Sat4j
- ToulBar2
- OPIUM
- MGTP
- MiniMaxSat
- MSUnCore
- GlueMiniSat
- Open-WBO
- PackUp
- CCASat
- LMHS
- WPM2
- MaxHS
- maxino
- CCLS
- CCEHC
- SATLike
- RC2
- New local search methods for partial MaxSAT
- Improved WPM encoding for coalition structure generation under MC-nets
- Iterative and core-guided maxsat solving: a survey and assessment
- A constraint optimization approach to causal discovery from subsampled time series data
- Boosting branch-and-bound MaxSAT solvers with clause learning
- WPM3
- On tackling the limits of resolution in SAT solving
- QMaxSAT: A partial Max-SAT solver
- Exploiting resolution-based representations for MaxSAT solving
- Open-WBO-Inc
- pytket
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Open-WBO: a modular MaxSAT solver
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- QMaxSATpb: a certified MaxSAT solver
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Using the method of conditional expectations to supply an improved starting point for CCLS
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for software: QMaxSAT
