Algorithms for Weighted Boolean Optimization
From MaRDI portal
(Redirected from Publication:3637182)
Recommendations
Cites work
- A linear-time transformation of linear inequalities into conjunctive normal form
- A logical approach to efficient Max-SAT solving
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- Minimaxsat: an efficient weighted Max-SAT solver
- New inference rules for Max-SAT
- On Inconsistent Clause-Subsets for Max-SAT Solving
- On SAT Modulo Theories and Optimization Problems
- On Solving the Partial MAX-SAT Problem
- Paths, Trees, and Flowers
- Resolution for Max-SAT
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- The first and second Max-SAT evaluations
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
Cited in
(33)- Satisfiability-based algorithms for Boolean optimization
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Iterative and core-guided maxsat solving: a survey and assessment
- A taxonomy of exact methods for partial Max-SAT
- Logic tensor networks
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Computing the Weight of a Boolean Function from Its Algebraic Normal Form
- Reducing chaos in SAT-like search: finding solutions close to a given one
- New heuristics and adaptive memory procedures for Boolean optimization problems
- Boolean lexicographic optimization: algorithms \& applications
- Curriculum-based course timetabling with SAT and MaxSAT
- Reformulation based MaxSat robustness
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Unsatisfiable core analysis and aggregates for optimum stable model search
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- MiFuMax -- a literate MaxSAT solver. System description
- RC2: an efficient MaxSAT solver
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Learning discrete decomposable graphical models via constraint optimization
- A propositional CONEstrip algorithm
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Haplotype inference with pseudo-Boolean optimization
- Proofs and Certificates for Max-SAT
- Solving satisfiability problems with preferences
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Solving weighted maximum satisfiability with branch and bound and clause learning
- Extending linear relaxation for non-square matrices and soft constraints
This page was built for publication: Algorithms for Weighted Boolean Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637182)
