Pages that link to "Item:Q2455454"
From MaRDI portal
The following pages link to Search techniques for SAT-based Boolean optimization (Q2455454):
Displaying 13 items.
- Dynamic symmetry-breaking for Boolean satisfiability (Q976993) (← links)
- Satisfiability-based algorithms for Boolean optimization (Q1430296) (← links)
- Black-box optimization in an extended search space for SAT solving (Q2181777) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- (Q4539619) (← links)
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers (Q4639475) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- Theory and Applications of Satisfiability Testing (Q5713710) (← links)
- Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem (Q6487934) (← links)