Pages that link to "Item:Q1430296"
From MaRDI portal
The following pages link to Satisfiability-based algorithms for Boolean optimization (Q1430296):
Displaying 22 items.
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- A heuristic for Boolean optimization problems (Q1402519) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Pseudo-Boolean optimization with a disjunctive constraint (Q1842348) (← links)
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient (Q2045943) (← links)
- Black-box optimization in an extended search space for SAT solving (Q2181777) (← links)
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Boolean Methods of Optimization over Independence Systems (Q3337220) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- (Q3795712) (← links)
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers (Q4639475) (← links)
- (Q4804883) (← links)
- (Q4808722) (← links)
- (Q4809068) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- (Q5146738) (← links)
- Characterizing Propagation Methods for Boolean Satisfiability (Q5756574) (← links)