QMaxSAT
From MaRDI portal
Software:21549
swMATH9568MaRDI QIDQ21549FDOQ21549
Author name not available (Why is that?)
Cited In (24)
- Exploiting Resolution-Based Representations for MaxSAT Solving
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Open-WBO: A Modular MaxSAT Solver,
- 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
- Resizing cardinality constraints for MaxSAT
- Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT
- 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
- On tackling the limits of resolution in SAT solving
- QMaxSAT: A partial Max-SAT solver
- Improvements to Core-Guided Binary Search for MaxSAT
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- 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
- 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
