scientific article
From MaRDI portal
Publication:3604010
zbMath1159.68561MaRDI QIDQ3604010
Chu-Min Li, Josep Argelich, Jordi Planes, Felip Manyà
Publication date: 24 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Efficient Learning of Interpretable Classification Rules ⋮ New local search methods for partial MaxSAT ⋮ Resolution-based lower bounds in MaxSAT ⋮ A Max-SAT Inference-Based Pre-processing for Max-Clique ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Incomplete inference for graph problems ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem ⋮ Reformulation based MaxSat robustness ⋮ Simple approximation algorithms for balanced MAX~2SAT ⋮ On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes ⋮ Optimizing with minimum satisfiability ⋮ Probabilistic characterization of random Max \(r\)-Sat ⋮ An abstract view on optimizations in SAT and ASP ⋮ Solving (Weighted) Partial MaxSAT through Satisfiability Testing ⋮ Generalizing Core-Guided Max-SAT ⋮ Algorithms for Weighted Boolean Optimization ⋮ Unnamed Item
Uses Software
This page was built for publication: