The following pages link to (Q3604010):
Displayed 18 items.
- New local search methods for partial MaxSAT (Q329035) (← links)
- Reformulation based MaxSat robustness (Q487654) (← links)
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Simple approximation algorithms for balanced MAX~2SAT (Q1742374) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- An abstract view on optimizations in SAT and ASP (Q2055811) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- Generalizing Core-Guided Max-SAT (Q3637181) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- Efficient Learning of Interpretable Classification Rules (Q5043563) (← links)
- (Q5148942) (← links)