Satisfiability-based algorithms for Boolean optimization
From MaRDI portal
Recommendations
Cited in
(23)- Boolean query optimization and the 0-1 hyperbolic sum problem
- A heuristic for Boolean optimization problems
- Optimal satisfiability for propositional calculi and constraint satisfaction problems.
- Optimizing with minimum satisfiability
- Pseudo-Boolean optimization with a disjunctive constraint
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient
- Black-box optimization in an extended search space for SAT solving
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
- A framework for certified Boolean branch-and-bound optimization
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Propositional SAT solving
- Boolean Methods of Optimization over Independence Systems
- Using Boolean Constraint Propagation for Sub-clauses Deduction
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- scientific article; zbMATH DE number 4061303 (Why is no real title available?)
- Boolean lexicographic optimization: algorithms \& applications
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- The quest for efficient Boolean satisfiability solvers
- Integrating Boolean and mathematical solving: Foundations, basic algorithms, and requirements
- The quest for efficient Boolean satisfiability solvers
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- scientific article; zbMATH DE number 7301717 (Why is no real title available?)
- Characterizing Propagation Methods for Boolean Satisfiability
This page was built for publication: Satisfiability-based algorithms for Boolean optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1430296)
