Exploiting subproblem optimization in SAT-based maxsat algorithms
From MaRDI portal
Publication:525063
DOI10.1007/S10732-015-9300-7zbMATH Open1360.90313OpenAlexW1863234917MaRDI QIDQ525063FDOQ525063
Authors: Carlos Ansótegui, Joel Gabàs, Jordi Levy 
Publication date: 28 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-015-9300-7
Recommendations
- SAT-based MaxSAT algorithms
- Exploiting resolution-based representations for MaxSAT solving
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Minimaxsat: an efficient weighted Max-SAT solver
- Introduction to algorithms.
- Handbook of constraint programming.
- Title not available (Why is that?)
- Lazy satisfiability modulo theories
- Iterative and core-guided maxsat solving: a survey and assessment
- QMaxSAT: A partial Max-SAT solver
- Improvements to core-guided binary search for MaxSAT
- SAT-based MaxSAT algorithms
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- On Solving the Partial MAX-SAT Problem
- Title not available (Why is that?)
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Metaheuristics—the metaphor exposed
- New inference rules for Max-SAT
- Exploiting Cycle Structures in Max-SAT
- Resolution lower bounds for the weak pigeonhole principle
- Boolean lexicographic optimization: algorithms \& applications
- Satisfiability modulo the theory of costs: foundations and applications
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- On SAT Modulo Theories and Optimization Problems
- Exploiting the power of MIP solvers in MAXSAT
- A logical approach to efficient Max-SAT solving
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- New Encodings of Pseudo-Boolean Constraints into CNF
- Unsatisfiability-based optimization in clasp
- A Complete Calculus for Max-SAT
Cited In (5)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- Exploiting the power of MIP solvers in MAXSAT
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
Uses Software
This page was built for publication: Exploiting subproblem optimization in SAT-based maxsat algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525063)
